A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm

DOI10.1109/18.256522MaRDI QIDQ4277179zbMATH OpenOpenAlexFDO

Authors Jian Gu, Tom Fuja

Publication date 7 February 1994

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

Full work available at URL http://hdl.handle.net/1903/5268

zbMATH Keywords

code division multiple accesscode search algorithmGilbert-Varshamov boundirregular spacesrunlength constraints

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Sharpening the Gilbert-Varshamov bound in the finite case
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
• Improving the Gilbert-Varshamov bound for q-ary codes
• Improved Gilbert-Varshamov bound for constrained systems

Cited in

(5)

• Information compression and Varshamov-Gilbert bound
• Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vlăduţ-Zink bounds
• The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
• Gilbert-Varshamov bound for Euclidean space codes over distance-uniform signal sets
• Maximizing entropy with an expectation constraint and one-parameter exponential families of distributions: a reexamination

This page was built for publication: A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm

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