Computer Science – Information Theory
Scientific paper
2009-09-14
Computer Science
Information Theory
v2: a correction concerning shortened codes of length 12
Scientific paper
10.1007/s10623-010-9450-4
The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. \"Osterg{\aa}rd and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such (13,512,3) codes. By applying a switching operation to those codes, two more (13,512,3) codes are obtained, which are then not doubly shortened perfect codes.
Östergård Patric R. J.
Pottonen Olli
No associations
LandOfFree
Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-564751