By Topic

On binary linear codes which satisfy the two-way chain condition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
S. B. Encheva ; Stord Haugesund Coll., Norway

General constructions of binary linear codes satisfying the two-way chain condition are found. Sufficient conditions for their existence are determined. Some of these codes are proven to be Z4 -linear. An expression for their state complexity profile is also found. Cases, when such codes have covering radius R=t[n, k] are shown

Published in:

IEEE Transactions on Information Theory  (Volume:42 ,  Issue: 3 )