Minimum distance of linear codes and the $Ξ±$-invariant
July 12, 2015 Β· Declared Dead Β· π Advances in Applied Mathematics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Mehdi Garrousian, Stefan Tohaneanu
arXiv ID
1507.03286
Category
math.AC
Cross-listed
cs.IT
Citations
13
Venue
Advances in Applied Mathematics
Last Checked
3 months ago
Abstract
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the methods of commutative/homological algebra to find connections between the minimum distance and the $Ξ±$-invariant of such modules.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.AC
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
The dual of an evaluation code
R.I.P.
π»
Ghosted
Generalized minimum distance functions
R.I.P.
π»
Ghosted
Generalized star configurations and the Tutte polynomial
R.I.P.
π»
Ghosted
Minimum distance functions of complete intersections
R.I.P.
π»
Ghosted
Higher Hamming weights for locally recoverable codes on algebraic curves
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted