Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
From MaRDI portal
Publication:1633300
DOI10.1016/J.FFA.2018.10.005zbMath1404.94136OpenAlexW2898498475MaRDI QIDQ1633300
Hongjun Xu, R. S. Raja Durai, Meenakshi Devi
Publication date: 19 December 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2018.10.005
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Complementary dual codes for counter-measures to side-channel attacks
- Quasi-twisted codes with constacyclic constituent codes
- Theory of codes with maximum rank distance
- Linear codes with complementary duals
- Galois LCD codes over finite fields
- Constructions of optimal LCD codes over large finite fields
- On self-dual negacirculant codes of index two and four
- Self-dual codes and orthogonal matrices over large finite fields
- A coding scheme that increases the code rate
- Erasure Techniques in MRD codes
- An estimate of the first eigenvalue of a Schrödinger operator on closed surfaces
- On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
- Packing and Covering Properties of Rank Metric Codes
- Coding for T-user multiple-access channels
- Error Detecting and Error Correcting Codes
- LCD Cyclic Codes Over Finite Fields
This page was built for publication: Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
