Published November 2018
| Submitted
Book Section - Chapter
Open
Optimum Linear Codes with Support Constraints over Small Fields
- Creators
- Yildiz, Hikmet
- Hassibi, Babak
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
- Eprint ID
- 92643
- DOI
- 10.1109/ITW.2018.8613535
- Resolver ID
- CaltechAUTHORS:20190204-162012565
- Created
-
2019-02-05Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field