Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
From MaRDI portal
Publication:2048936
Recommendations
Cites work
- scientific article; zbMATH DE number 139592 (Why is no real title available?)
- scientific article; zbMATH DE number 1789344 (Why is no real title available?)
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
- Theory of codes with maximum rank distance
Cited in
(8)- Low-rank parity-check codes over Galois rings
- Decoding LDPC Codes Over Integer Residue Rings
- Integer Ring Sieve for Constructing Compact QC-LDPC Codes With Girths 8, 10, and 12
- Rank-metric codes and their applications
- On the rank decoding problem over finite principal ideal rings
- An upper-bound on the decoding failure probability of the LRPC decoder
- Solving systems of algebraic equations over finite commutative rings and applications
- Low-rank parity-check codes over finite commutative rings
This page was built for publication: Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048936)