Abstract
The performance and structure of wiretap codes are analyzed in the limit of large code size and very low- or very high-rate codes. Under these conditions, code performance may be calculated using the properties of subspaces of the available code space. Using this technique, a code defined by a generator matrix with a uniform distribution of nonzero columns is proven to be locally optimal.
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.