A family of linear codes from constant dimension subspace codes
type: Item
instance of: scholarly article
title: A family of linear codes from constant dimension subspace codes
zbMATH Open document ID: 1480.94038
author: Xia Li
author: Qin Yue
author: Deng Tang
published in: Designs, Codes and Cryptography
publication date: 2022-01-19T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 7459691
zbMATH Keywords: linear codes
zbMATH Keywords: constant dimension codes
zbMATH Keywords: Griesmer bound
zbMATH Keywords: weight distribution
MaRDI profile type: Publication
full work available at URL: s10623-021-00960-x
OpenAlex ID: W3208205464
cites work: Network information flow
cites work: On perfect codes and related concepts
cites work: Minimal vectors in linear codes
cites work: Minimal Linear Codes in Odd Characteristic
cites work: Strongly regular graphs, partial geometries and partially balanced designs
cites work: The Geometry of Two-Weight Codes
cites work: Linear codes from simplicial complexes
cites work: On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
cites work: Linear Codes From Some 2-Designs
cites work: A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
cites work: Q4452086
cites work: Minimal Binary Linear Codes
cites work: Error-Correcting Codes in Projective Space
cites work: The separation of binary relative three-weight codes and its applications
cites work: Equidistant subspace codes
cites work: A new class of nonbinary codes meeting the Griesmer bound
cites work: Further classifications of codes meeting the Griesmer bound (Corresp.)
cites work: Projective codes meeting the Griesmer bound
cites work: Minimal linear codes over finite fields
cites work: Fundamentals of Error-Correcting Codes
cites work: New binary linear codes which are dual transforms of good codes
cites work: Coding for Errors and Erasures in Random Network Coding
cites work: Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
cites work: A family of distance-optimal minimal linear codes with flexible parameters
cites work: On relative constant-weight codes
cites work: Anticodes for the Grassmann and bilinear forms graphs
cites work: Codes and anticodes in the Grassman graph
cites work: How to share a secret
cites work: Algebraically punctured cyclic codes
cites work: Optimal Few-Weight Codes From Simplicial Complexes
cites work: Johnson type bounds on constant dimension codes
cites work: A family of optimal ternary cyclic codes from the Niho-type exponent
cites work: Secret sharing schemes from three classes of linear codes
cites work: Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
cites work: Three-weight ternary linear codes from a family of cyclic difference sets
cites work: A class of three-weight cyclic codes
cites work: Linear codes with two or three weights from quadratic bent functions
DOI: 10.1007/S10623-021-00960-X
description: scientific article; zbMATH DE number 7459691