Projective Linear Codes From Some Almost Difference Sets

DOI10.1109/TIT.2022.3203380MaRDI QIDQ6193574zbMATH OpenOpenAlexFDO

Authors Ziling Heng

Publication date 18 March 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2022.3203380

zbMATH Keywords

almost difference setalmost MDS codelinear codelocally recoverable code

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(6)

• The subfield and extended codes of a subclass of optimal three-weight cyclic codes
• Construction of three class of at most four-weight binary linear codes and their applications
• Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
• Infinite families of linear codes over finite fields with new parameters and their hull dimensions
• Constructions of divisible difference sets, almost difference sets and special partial direct product difference sets from binary sequences
• Several classes of optimal linear codes with few weights from simplicial complexes

This page was built for publication: Projective Linear Codes From Some Almost Difference Sets

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