Optimization of cyclic redundancy-check codes with 24 and 32 paritybits
Castagnoli, G.; Brauer, S.; Herrmann, M.
Communications, IEEE Transactions on
Volume 41, Issue 6, Jun 1993 Page(s):883 - 892
Digital Object Identifier   10.1109/26.231911
Summary:The method developed by T. Fujiwara et al. (1985) for efficiently computing the minimum distance of shortened Hamming codes using the weight distribution of their dual codes is extended to treat arbitrary shortened cyclic codes. Using this method implemented on a high-speed special-purpose processor, several classes of cyclic redundancy-check (CRC) codes with 24 and 32 parity bits are investigated. The CRC codes of each class are known to have the same minimum distance d_min.L in a certain range L of block lengths n, and within each class that CRC code has been determined the minimum distance of which exceeds d_min.L up to the largest block length. The d_min profiles of the resulting codes are presented and compared with the d_min profiles of recent suggestions of P. Merkey and E. C. Posner (1984), as well as with the d_min profile of the widely used 32 parity-bit standard code recommended in IEEE-802

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.