Quaternary Unequal Error Protection Codes
From MaRDI portal
Abstract: We provide bounds for codes for a non-symmetric channel or, equivalently, for ternary codes with the Manhattan distance.
Recommendations
Cites work
- scientific article; zbMATH DE number 3880581 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A class of cyclic unequal error protection codes (Corresp.)
- Bounds on volume of linear codes with unequal information-symbol protection
- Computer search for binary cyclic UEP codes of odd length up to 65
- Constructing linear unequal error protection codes from algebraic curves
- Encoding and decoding for the minimization of message symbol error rates in linear block codes
- Improved upper bounds for codes with unequal error protection
- Linear unequal error protection codes
- Linear unequal error protection codes from shorter codes (Corresp.)
- New codes via the lengthening of BCH codes with UEP codes
- Nonuniform Error Correction Using Low-Density Parity-Check Codes
- On a class of optimal nonbinary linear unequal-error-protection codes for two sets of messages
- On an infinite series of<tex>[4n, 2n]</tex>binary codes (Corresp.)
- On linear unequal error protection codes
- On primitive BCH codes with unequal error protection capabilities
- Optimal encodings of linear block codes for unequal error protection
- Optimal linear codes over \(\mathrm{GF}(4)\)
- Searching for linear codes with large minimum distance
- Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes
- Unequal error protection codes derived from difference sets (Corresp.)
- Unequal error protection for convolutional codes
Cited in
(3)
This page was built for publication: Quaternary Unequal Error Protection Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540934)
