Low-rank parity-check codes over Galois rings
From MaRDI portal
Publication:2227130
DOI10.1007/s10623-020-00825-9OpenAlexW3112682786MaRDI QIDQ2227130
Alessandro Neri, Julian Renner, Sven Puchinger
Publication date: 10 February 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.10588
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (2)
Convolutional codes over finite chain rings, MDP codes and their characterization ⋮ Rank-Metric Codes and Their Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- A metric for codes over residue class rings
- Linear codes over finite chain rings
- Modern Computer Algebra
- Lattices Over Eisenstein Integers for Compute-and-Forward
- Communication Over Finite-Chain-Ring Matrix Channels
- A Rank-Metric Approach to Error Control in Random Network Coding
- Codes over integer residue rings
- Codes over Zm, revisited
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
- Compute-and-Forward: Harnessing Interference Through Structured Codes
- Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
- An Algebraic Approach to Physical-Layer Network Coding
- An Algebraic Framework for End-to-End Physical-Layer Network Coding
- Codes over certain rings
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Low-rank parity-check codes over Galois rings
