Low-rank parity-check codes over Galois rings

Low-rank parity-check (LRPC) codes are rank-metric codes over finite fields, which have been proposed by Gaborit et al. (Proceedings of the workshop on coding and cryptography WCC, vol 2013, 2013) for cryptographic applications. Inspired by a recent adaption of Gabidulin codes to certain finite ring...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Designs, codes, and cryptography Ročník 89; číslo 2; s. 351 - 386
Hlavní autori:	Renner, Julian, Neri, Alessandro, Puchinger, Sven
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2021 Springer Nature B.V
Predmet:	Algorithms Binary system Codes Coding and Information Theory Computer Science Cryptography Cryptology Decoding Discrete Mathematics in Computer Science Fields (mathematics) Parity Rings (mathematics) Upper bounds Rank-metric codes Algebraic coding theory 11T71 Low-rank parity-check codes Galois rings
ISSN:	0925-1022, 1573-7586, 1573-7586
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!