A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters - Concepedia

Concepedia

Publication | Closed Access

A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters

36

Citations

7

References

1993

Year

A.E. Brouwer, Ludo Tolhuizen

Designs Codes and Cryptography

Mathematical ProgrammingEngineeringJoint Source-channel CodingLower BoundJohnson BoundLinear CodesComputational ComplexityBinary Linear CodesDiscrete MathematicsApproximation TheoryError Correction CodeVariable-length Code

References

	Year	Citations

Page 1