An improvement of the Gilbert bound for constant weight codes (Corresp.)
From MaRDI portal
Publication:3775475
DOI10.1109/TIT.1987.1057344zbMATH Open0635.94018MaRDI QIDQ3775475FDOQ3775475
Victor A. Zinoviev, Thomas Ericson
Publication date: 1987
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Improving the Gilbert-Varshamov bound for \(q\)-ary codes
- Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes
- Some new upper bounds for constant weight codes (Corresp.)
- An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
- A modification of the Zinoviev lower bound for constant weight codes
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- New lower bounds for constant weight codes
- Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
- Some lower bounds for constant weight codes
- An upper bound for binary constant weight codes
Cited In (6)
- A new construction for \(q\)-ary constant weight codes
- Traceability codes and their generalizations
- Algebraic-geometric codes and asymptotic problems
- Improved Lower Bounds for Constant GC-Content DNA Codes
- New explicit binary constant weight codes from Reed-Solomon codes
- Coding for a multiple access OR channel: A survey
This page was built for publication: An improvement of the Gilbert bound for constant weight codes (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775475)
