Evaluating the Gilbert-Varshamov bound for constrained systems
We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that the GV bound can be determined via the solution of an optimization problem. Later, in 1992, Marcus and Roth modified the optimization problem and improved the GV bound in man...
Saved in:
Main Authors: | Goyal, Keshav, Kiah, Han Mao |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/178934 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vlǎduţ-Zink bounds
by: Xing, C.
Published: (2014) -
On List-Decodability of Random Rank Metric Codes and Subspace Codes
by: Ding, Yang
Published: (2016) -
Further improvements on asymptotic bounds for codes using distinguished divisors
by: Niederreiter, H., et al.
Published: (2014) -
Good self-dual quasi-cyclic codes exist
by: Ling, S., et al.
Published: (2014) -
Goppa geometric codes achieving the Gilbert-Varshamov bound
by: Xing, C.
Published: (2014)