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

Full description

Saved in:

Bibliographic Details
Published in:	Designs, codes, and cryptography Vol. 89; no. 2; pp. 351 - 386
Main Authors:	Renner, Julian, Neri, Alessandro, Puchinger, Sven
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2021 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!