Computer Search for Binary Cyclic UEP Codes of Odd Length Up to 65
Journal
IEEE Transactions on Information Theory
Journal Volume
36
Journal Issue
4
Pages
924-935
Date Issued
1990
Author(s)
Abstract
Exhaustive computation by a computer was used to find the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances of at least 3. For those codes for which upper bounds can only be computed on their unequal error protection capabilities, an analytic method developed by V.N. Dynkin and V.A. Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities.>
SDGs
Type
journal article