Gilbert-Varshamov bound for Euclidean space codes over distance-uniform signal sets

DOI10.1109/18.979331zbMATH Open1071.94539OpenAlexW2113811543MaRDI QIDQ4544810FDOQ4544810

Authors:

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: http://eprints.iisc.ac.in/5023/1/gilbert.pdf

Recommendations

• A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm
• A Gilbert-Varshamov type bound for Euclidean packings
• Sharpening the Gilbert-Varshamov bound in the finite case
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Bounds on codes (94B65) Modulation and demodulation in information and communication theory (94A14)

Cited In (2)

• A Gilbert-Varshamov type bound for Euclidean packings
• An approach to Ungerboeck coding for rectangular signal sets (Corresp.)

This page was built for publication: Gilbert-Varshamov bound for Euclidean space codes over distance-uniform signal sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544810)