Low-rank parity-check codes over Galois rings

DOI10.1007/S10623-020-00825-9MaRDI QIDQ2227130zbMATH OpenOpenAlexFDO

Authors Julian Renner, Alessandro Neri, Sven Puchinger

Publication date 10 February 2021

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2006.10588

zbMATH Keywords

algebraic coding theoryGalois ringslow-rank parity-check codesrank-metric codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Recommendations

• Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
• Decoding of linear codes over Galois rings
• Galois geometries and low-density parity-check codes
• On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
• Galois correspondence on linear codes over finite chain rings
• On cyclic codes over Galois rings
• Parity check systems of nonlinear codes over finite commutative Frobenius rings
• Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
• scientific article; zbMATH DE number 5575566
• Quadratic residue codes over Galois rings

Cites work

• A metric for codes over residue class rings
• A Rank-Metric Approach to Error Control in Random Network Coding
• An Algebraic Approach to Physical-Layer Network Coding
• An Algebraic Framework for End-to-End Physical-Layer Network Coding
• Bilinear forms over a finite field, with applications to coding theory
• Codes over certain rings
• Codes over integer residue rings
• Codes over Zm, revisited
• Communication Over Finite-Chain-Ring Matrix Channels
• Compute-and-Forward: Harnessing Interference Through Structured Codes
• scientific article; zbMATH DE number 3460471 (Why is no real title available?)
• scientific article; zbMATH DE number 1789344 (Why is no real title available?)
• Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
• Lattices Over Eisenstein Integers for Compute-and-Forward
• Linear codes over finite chain rings
• Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
• Maximum-rank array codes and their application to crisscross error correction
• Modern computer algebra
• Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Theory of codes with maximum rank distance

Cited in

(9)

• Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
• Rank-metric codes and their applications
• Convolutional codes over finite chain rings, MDP codes and their characterization
• Low-Rank Parity-Check Codes over Galois Rings
• On the rank decoding problem over finite principal ideal rings
• An upper-bound on the decoding failure probability of the LRPC decoder
• Information set decoding for ring-linear codes
• 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: Low-rank parity-check codes over Galois rings

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