A note on full weight spectrum codes
Preprint
Abstract
A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS) code if there exist codewords of each nonzero weight less than or equal to $ n $. In this brief communication we determine necessary and sufficient conditions for the existence of linear $ [n,k]_q $ full weight spectrum (FWS) codes. Central to our approach is the geometric view of linear codes, whereby columns of a generator matrix correspond to points in $ PG(k-1,q) $.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- How many weights can a linear code have?Designs, Codes and Cryptography, 2018
- On Binary Linear Codes Whose Automorphism Group is TrivialJournal of Discrete Mathematical Sciences and Cryptography, 2015
- Finite Geometry and Combinatorial Applications2015
- On sets of vectors of a finite vector space in which every subset of basis size is a basisJournal of the European Mathematical Society, 2012
- Codes with given distancesGraphs and Combinatorics, 1987
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973
- A Theorem on the Distribution of Weights in a Systematic Code†Bell System Technical Journal, 1963
- A Class of Binary Signaling AlphabetsBell System Technical Journal, 1956