Linear codes and character sums

DOI10.1007/S00493-002-0003-YMaRDI QIDQ1410404zbMATH OpenOpenAlexFDO

Authors Alex Samorodnitsky, Nathan Linial

Publication date 14 October 2003

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-002-0003-y

zbMATH Keywords

character sumsHamming weightfraction of code words with a fixed weight

Mathematics Subject Classification ID

Bounds on codes (94B65) Extremal set theory (05D05) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Estimates for distribution of the minimal distance of a random linear code
• On the distance distribution of codes
• A nonconstructive upper bound on covering radius
• On covering radius lower bound for a class of binary codes
• Bounds for Binary Codes With Narrow Distance Distributions
• scientific article; zbMATH DE number 4218374
• The linear programming bound for binary linear codes
• One more proof of the first linear programming bound for binary codes and two conjectures
• An updated table of minimum-distance bounds for binary linear codes
• Code pairs with specified parity of the Hamming distances

Cited in

(17)

• On the weight distribution of random binary linear codes
• One more proof of the first linear programming bound for binary codes and two conjectures
• scientific article; zbMATH DE number 2154157 (Why is no real title available?)
• Property testing lower bounds via a generalization of randomized parity decision trees
• scientific article; zbMATH DE number 1426191 (Why is no real title available?)
• A coding theory bound and zero-sum square matrices
• On vectors of minimal support in transitive linear spaces
• scientific article; zbMATH DE number 431468 (Why is no real title available?)
• On the most weight w vectors in a dimension k binary code
• Estimates of the neighborhood volumes of binary codes via their weight spectra
• Bounds on distance distributions in codes of given size
• Note on large subsets of binary vectors with similar distances
• Investigation of Linear Codes Possessing Some Extra Properties
• Small Linear Dependencies for Binary Vectors of Low Weight
• Linear codes with exponentially many light vectors
• On the minimal distance of a polynomial code
• On the generalized weights of a class of trace codes

This page was built for publication: Linear codes and character sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410404)