By Topic

Bounds on constant weight codes correcting localized errors

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)
P. Larsson ; Dept. of Electr. Eng., Linkoping Univ., Sweden

We derive upper and lower bounds for constant weight codes on a channel with localized errors. Coding for channels with localized errors is a new branch of coding theory. From a practical point of view it is important to find good, easily decodable codes. From an information theory point of view it is important to investigate how good these codes can be, that is finding the theoretical limits. For conventional error correcting codes a great deal of interest has been directed towards constant weight codes. They have properties which make them interesting in various situations. This fact has motivated us to look at constant weight codes for localized errors

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 2 )