Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer

DOI10.1007/s40065-021-00327-zzbMath1476.94055OpenAlexW3175475550WikidataQ114219609 ScholiaQ114219609MaRDI QIDQ2048936

Hervé Talé Kalachi, Franck Rivel Kamwa Djomou, Emmanuel Fouotsa

Publication date: 24 August 2021

Published in: Arabian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40065-021-00327-z

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Decoding (94B35)

Related Items (1)

Rank-Metric Codes and Their Applications

Cites Work

• Theory of codes with maximum rank distance
• Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
• Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer