Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
DOI10.1109/TIT.2019.2933520zbMATH Open1433.94155OpenAlexW2964936392MaRDI QIDQ5211532FDOQ5211532
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
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Decoding (94B35)
Cited In (9)
- Low-rank parity-check codes over Galois rings
- On the rank decoding problem over finite principal ideal rings
- Division algebras and MRD codes from skew polynomials
- Extending two families of maximum rank distance codes
- Cardinal rank metric codes over Galois rings
- MDS codes over finite principal ideal rings
- Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
- Rank-metric codes and their applications
- Title not available (Why is that?)
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)
