Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published November 2018 | Submitted
Book Section - Chapter Open

Optimum Linear Codes with Support Constraints over Small Fields

Abstract

The problem of designing a linear code with the largest possible minimum distance, subject to support constraints on the generator matrix, has recently found several applications. These include multiple access networks [3], [5] as well as weakly secure data exchange [4], [8]. A simple upper bound on the maximum minimum distance can be obtained from a sequence of Singleton bounds (see (3) below) and can further be achieved by randomly choosing the nonzero elements of the generator matrix from a field of a large enough size.

Additional Information

© 2018 IEEE.

Attached Files

Submitted - 1803.03752.pdf

Files

1803.03752.pdf
Files (104.1 kB)
Name Size Download all
md5:4348f48b8c8f1305b0cde8fbab8e2339
104.1 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024