Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Linear programming bounds for codes via a covering argument
Michael Navon
,
Alex Samorodnitsky
*
*
Corresponding author for this work
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
22
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Linear programming bounds for codes via a covering argument'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Hamming Cube
100%
Linear Programming Bound
100%
Bounds on Codes
100%
Delsarte
100%
Orthogonal Polynomials
50%
Large Distances
50%
Error Correction Codes
50%
Isoperimetric Constant
50%
Linear Programming
50%
Linear Programming Method
50%
McEliece
50%
Binary Error
50%
Covering Radius
50%
Polynomial Theory
50%
Fourier Duality
50%
Faber-Krahn
50%
Mathematics
Linear Programming
100%
Cube
66%
Orthogonal Polynomial
33%
Error Correcting Codes
33%
Linear Program
33%
Covering Radius
33%