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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on information theory Ročník 66; číslo 11; s. 6762 - 6773
Hlavní autori:	Hyun, Jong Yoon, Lee, Jungyun, Lee, Yoonjin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	3G mobile communication 94A60 Binary codes Binary system Codes Cost accounting Criteria Cryptography Generators Griesmer code Linear codes Mathematics Optimal linear code simplicial complex weight distribution 2010 AMS Subject Classification 94B05
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!