LCD matrix product codes with an application

DOI10.1142/S179383092250104XOpenAlexW4224990297MaRDI QIDQ6132858FDOQ6132858

Authors: 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

zbMATH Keywords

LCD codeFrobenius ringmatrix product code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• Linear codes with complementary duals
• The condition for a cyclic code to have a complementary dual
• Linear codes with complementary duals meet the Gilbert-Varshamov bound
• Complementary dual codes for counter-measures to side-channel attacks
• Duality for modules over finite rings and applications to coding theory
• Matrix product codes over finite commutative Frobenius rings
• Matrix-product codes over \(\mathbb{F}_q\)
• Private information retrieval
• Title not available (Why is that?)
• New linear codes from matrix-product codes with polynomial units
• Construction and bound on the performance of matrix-product codes
• Some bounds on binary LCD codes
• The hulls of matrix-product codes over commutative rings and applications
• On the minimum distance of certain reversible cyclic codes (Corresp.)
• Do non-free LCD codes over finite commutative Frobenius rings exist?
• On $\sigma$ -LCD Codes
• Multisecret-sharing schemes and bounded distance decoding of linear codes

This page was built for publication: LCD matrix product codes with an application

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