Abstract
The usual statement of the Gilbert bound is an assertion that at least one member of a given ensemble of codes satisfies a minimum distance criterion. This result is strengthened by showing that for sufficiently large constraint lengths, an arbitrarily large fraction of the ensemble of codes have minimum distance exceeding the usual asymptotic Gilbert bound. New asymptotic bounds are derived for the nonbinary case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.