Constructions and bounds for systematic tEC/AUED codes
From MaRDI portal
Publication:3199342
DOI10.1109/18.59933zbMATH Open0713.94027OpenAlexW2101925257MaRDI QIDQ3199342FDOQ3199342
Authors: Frank J. H. Böinck, Henk van Tilborg
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.59933
Recommendations
- On the construction of systematic tEC/AUED codes
- Construction of t-EC/AUED codes
- An improvement on constructions of t-EC/AUED codes
- Another method for constructing t-EC/AUED codes
- New techniques for constructing EC/AUED codes
- New techniques for constructing \(t\)-EC/\(d\)-ED/AUED and \(t\)-EC/\(d\)-ED/\(s\)-UED codes
- DC/sub m/ codes for constructing t-EC/AUED codes
- Some Optimal Binary and Ternary $t$-EC-AUED Codes
- A note on t-EC/d-UED codes
- On the analysis and design of group theoretical t-syEC/AUED codes
Cited In (12)
- An improvement on constructions of t-EC/AUED codes
- On the analysis and design of group theoretical t-syEC/AUED codes
- Another method for constructing t-EC/AUED codes
- Construction of t-EC/AUED codes
- LYM-type inequalities for tEC/AUED codes
- Title not available (Why is that?)
- Systematic variable length check binary unordered/AUED codes
- A note on SEC/AUED codes
- Systematic t-Error Correcting/All Unidirectional Error Detecting Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- New techniques for constructing \(t\)-EC/\(d\)-ED/AUED and \(t\)-EC/\(d\)-ED/\(s\)-UED codes
This page was built for publication: Constructions and bounds for systematic tEC/AUED codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199342)