scientific article; zbMATH DE number 1498796
From MaRDI portal
Publication:4500987
A subset \(C\) of \(F^n\) is a uniquely decodable (UD) code if, for every \(v\in F^n\), there exists a unique \(c\in C\) such that \(d(v,C)=d(v,c)\). The structure of UD codes is studied. All linear UD codes of covering radius not more than 2 are determined. It is proven that a linear UD code with covering radius 2 is either the trivial \([5,1,5]\) repetition code or the product of two Hamming codes. Special perfect subcodes of a linear UD code are considered. For the entire collection see [Zbl 0918.00043].
Recommendations
- On the characterization of linear uniquely decodable codes
- Caractérisation results about L codes
- scientific article; zbMATH DE number 3997698
- On the complete decoding of binary linear codes (Corresp.)
- scientific article; zbMATH DE number 3908334
- On the equivalence of linear codes
- On linear rigidity of a class of codes
- A remark on linear codes
- On the reconstruction of linear codes
- scientific article; zbMATH DE number 2161575
Cited in
(9)- On the characterization of linear uniquely decodable codes
- Uniqueness of codes using semidefinite programming
- Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
- On the set of uniquely decodable codes with a given sequence of code word lengths
- On universally decodable matrices for space-time coding
- On the Existence of Universally Decodable Matrices
- On Unique Decodability
- On the universality of the LZ-based decoding algorithm
- Higher genus universally decodable matrices (UDMG)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500987)
