Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
A linear code is optimal if it has the highest minimum distance of any linear code with a given length and dimension. We construct infinite families of optimal binary linear codes <inline-formula> <tex-math notation="LaTeX">C_{\Delta ^{c}} </tex-math></inline-formula&g...
Saved in:
| Published in: | IEEE transactions on information theory Vol. 66; no. 11; pp. 6762 - 6773 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.11.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!