NASA NTRS · 19910048585
Computer search for binary cyclic UEP codes of odd length up to 65
Abstract
Using an exhaustive computation, the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances at least 3 are found. For those codes that can only have upper bounds on their unequal error protection capabilities computed, an analytic method developed by Dynkin and Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities.
Keep this discovery
Explore connections, maps & timelines
Lin, Mao-Chao, Lin, Chi-Chang, Lin, Shu. 1990-07-01. Computer search for binary cyclic UEP codes of odd length up to 65. https://ntrs.nasa.gov/citations/19910048585
Cite the original work for its findings. Save a collection to share your selection of sources.