Shortened Linear Codes Over Finite Fields

DOI10.1109/TIT.2021.3087082zbMath1486.94170arXiv2007.05901OpenAlexW3170844331MaRDI QIDQ4958214

Cunsheng Ding, Yang Liu, Chun-Ming Tang

Publication date: 7 September 2021

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

Full work available at URL: https://arxiv.org/abs/2007.05901

zbMATH Keywords

infinite families of 2-designsoptimal shortened codes over finite fieldsshortened linear codesshortening technique

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Other designs, configurations (05B30) Cyclic codes (94B15)

Related Items (6)

The minimum locality of linear codes ⋮ The punctured codes of two classes of cyclic codes with few weights ⋮ Some shortened codes from linear codes constructed by defining sets ⋮ Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) ⋮ Some 3-designs and shortened codes from binary cyclic codes with three zeros ⋮ Unnamed Item

This page was built for publication: Shortened Linear Codes Over Finite Fields