Some shortened codes from linear codes constructed by defining sets
From MaRDI portal
Publication:6112207
DOI10.3934/amc.2022063zbMath1521.94106MaRDI QIDQ6112207
Chun-Ming Tang, Min Guo, Can Xiang
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Cites Work
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A class of linear codes with a few weights
- Complete weight distributions of two classes of cyclic codes
- Linear codes with few weights from inhomogeneous quadratic functions
- Linear codes from quadratic forms
- Recent results and problems on constructions of linear codes from cryptographic functions
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Two classes of two-weight linear codes
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Some 2-Designs
- Cyclotomic Linear Codes of Order $3$
- Fundamentals of Error-Correcting Codes
- Designs from Linear Codes
- Shortened Linear Codes Over Finite Fields
- Some Punctured Codes of Several Families of Binary Linear Codes
- Shortened Linear Codes From APN and PN Functions
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
- A Family of Five-Weight Cyclic Codes and Their Weight Enumerators
