Weight and distance structure of Nordstrom-Robinson quadratic code
From MaRDI portal
Publication:5556896
DOI10.1016/S0019-9958(68)90515-9zbMath0169.51003OpenAlexW2061048888MaRDI QIDQ5556896
Publication date: 1968
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(68)90515-9
Related Items
Upper bounds on the general covering numberCλ(v,k,t,m), Algebraic theory of block codes detecting independent errors, On the Golay perfect binary code, A construction scheme for linear and non-linear codes, General upper bounds on the minimum size of covering designs