A remark on Plotkin's bound

IEEE Transactions on Information Theory

Volumn 47, Issue 1, 2001, Pages 352-355

  De Launey, W ^a   Gordon, D M ^a  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

Author keywords

Goldbach conjecture; Hadamard matrix; High distance binary block codes; Paley matrix; Plotkin bound

Indexed keywords

ASYMPTOTIC STABILITY; BINARY CODES; HEURISTIC METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; THEOREM PROVING;

GOLDBACH CONJECTURE; HADAMARD MATRIX; HIGH-DISTANCE BINARY BLOCK CODES; PALEY MATRIX; PLOTKIN BOUND;

BLOCK CODES;

EID: 0035084781     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.904534     Document Type: Article

References (9)

1. Hadamard matrices and designs
2. On the probabilistic complexity of numerically checking the binary Goldbach conjecture in certain intervals
3. New experimental results concerning the Goldbach conjecture
4. On the asymptotic existence of partial complex hadamard matrices and related combinatorial objects
5. A comment on the Hadamard conjecture
6. Unexpected irregularities in the distribution of prime numbers
7. Harold Cramér and the distribution of prime numbers
8. The application of hadamard matrices to a problem in coding
9. 8