Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Self-orthogonal 3-(56,12,65) designs and extremal doubly-even self-dual codes of length 56
Harada M. Designs, Codes and Cryptography38 (1):5-16,2006.Type:Article
Date Reviewed: Jan 15 2008

If you want to know that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56, that the code words of minimum weight generate an extremal doubly-even self-dual code of length 56, and that there exist at least 1,151 inequivalent extremal doubly-even self-dual codes of length 56, then this paper is for you.

In spite of the apparent complexity of the notation, the paper is surprisingly easy to read, even for a nonmathematician. All of the concepts are explained in easy-to-understand language. Nevertheless, the paper is a purely theoretical mathematics exposition. The authors make no attempt to even suggest that there might be practical applications at this time. I know of no such applications either. Still, even though I am not officially a mathematician, I enjoyed reading the paper and believe that others interested in designs and codes might find something of interest in the paper as well. An appendix provides complete lists of vectors for six nonequivalent codes.

Reviewer:  F. Gail Gray Review #: CR135108 (0811-1092)
Bookmark and Share
 
Error Control Codes (E.4 ... )
 
 
Code Breaking (E.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Error Control Codes": Date
Error coding cookbook
Rorabaugh C., McGraw-Hill, Inc., Hightstown, NJ, 1996. Type: Book (9780079117205)
Apr 1 1997
Trellis decoding of block codes
Honary B., Markarian G., Kluwer Academic Publishers, Norwell, MA, 1997. Type: Book (9780792398608)
Mar 1 1998
An enumeration of binary self-dual codes of length 32
Bilous R., Van Rees G. Designs, Codes and Cryptography 26(1/2/3): 61-86, 2002. Type: Article
Mar 6 2003
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy