LCD matrix product codes with an application
From MaRDI portal
Publication:6132858
DOI10.1142/s179383092250104xOpenAlexW4224990297MaRDI QIDQ6132858
Sanjit Bhowmick, Satya Bagchi, Rama Krishna Bandi
Publication date: 15 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s179383092250104x
Cites Work
- Complementary dual codes for counter-measures to side-channel attacks
- New linear codes from matrix-product codes with polynomial units
- Linear codes with complementary duals
- The condition for a cyclic code to have a complementary dual
- Some bounds on binary LCD codes
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- The hulls of matrix-product codes over commutative rings and applications
- Do non-free LCD codes over finite commutative Frobenius rings exist?
- Matrix product codes over finite commutative Frobenius rings
- Private information retrieval
- Duality for modules over finite rings and applications to coding theory
- On $\sigma$ -LCD Codes
- On the minimum distance of certain reversible cyclic codes (Corresp.)
- Multisecret-sharing schemes and bounded distance decoding of linear codes
- Matrix-product codes over \(\mathbb{F}_q\)
- Unnamed Item
- Unnamed Item
This page was built for publication: LCD matrix product codes with an application