A family of linear codes from constant dimension subspace codes
From MaRDI portal
Publication:2068376
DOI10.1007/s10623-021-00960-xzbMath1480.94038OpenAlexW3208205464MaRDI QIDQ2068376
Publication date: 19 January 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00960-x
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Unnamed Item
- Linear codes with two or three weights from quadratic bent functions
- Equidistant subspace codes
- Johnson type bounds on constant dimension codes
- Projective codes meeting the Griesmer bound
- A new class of nonbinary codes meeting the Griesmer bound
- Codes and anticodes in the Grassman graph
- Linear codes from simplicial complexes
- Three-weight ternary linear codes from a family of cyclic difference sets
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Minimal linear codes over finite fields
- Anticodes for the Grassmann and bilinear forms graphs
- A family of distance-optimal minimal linear codes with flexible parameters
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- The separation of binary relative three-weight codes and its applications
- On relative constant-weight codes
- A class of three-weight cyclic codes
- Strongly regular graphs, partial geometries and partially balanced designs
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Some 2-Designs
- How to share a secret
- Further classifications of codes meeting the Griesmer bound (Corresp.)
- Secret sharing schemes from three classes of linear codes
- Fundamentals of Error-Correcting Codes
- Coding for Errors and Erasures in Random Network Coding
- The Geometry of Two-Weight Codes
- On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
- Network information flow
- New binary linear codes which are dual transforms of good codes
- Minimal Binary Linear Codes
- Minimal vectors in linear codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Minimal Linear Codes in Odd Characteristic
- Error-Correcting Codes in Projective Space
- Algebraically punctured cyclic codes
- On perfect codes and related concepts
This page was built for publication: A family of linear codes from constant dimension subspace codes
