Rank-Metric Codes Over Finite Principal Ideal Rings and Applications

DOI10.1109/TIT.2019.2933520MaRDI QIDQ5211532zbMATH OpenOpenAlexFDO

Authors Hermann Tchatchiem Kamche, Christophe Mouaha

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2019.2933520

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear codes (general theory) (94B05) Decoding (94B35)

Cited in

(17)

• MDS codes over finite principal ideal rings
• Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
• Extending two families of maximum rank distance codes
• Low-rank parity-check codes over Galois rings
• Cardinal rank metric codes over Galois rings
• scientific article; zbMATH DE number 7177945 (Why is no real title available?)
• Rank-metric codes and their applications
• Division algebras and MRD codes from skew polynomials
• On the rank decoding problem over finite principal ideal rings
• Quotients of skew polynomial rings: new constructions of division algebras and MRD codes
• Information set decoding for ring-linear codes
• Solving systems of algebraic equations over finite commutative rings and applications
• LCD codes over Galois rings
• Low-rank parity-check codes over finite commutative rings
• MacWilliams duality for rank metric codes over finite chain rings
• Valued rank-metric codes
• On the generalizations of the rank metric over finite chain rings

This page was built for publication: Rank-Metric Codes Over Finite Principal Ideal Rings and Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211532)