Bounds on mixed binary/ternary codes
From MaRDI portal
Publication:4392441
DOI10.1109/18.651001zbMath0911.94009OpenAlexW2165062870MaRDI QIDQ4392441
Patric R. J. Östergård, N. J. A. Sloane, Andries E. Brouwer, Heikki O. Hämäläinen
Publication date: 8 June 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.651001
Related Items
Balancedly splittable Hadamard matrices, On ℤ2ℤ2[u-additive codes], Constacyclic codes of length \((p^r,p^s)\) over mixed alphabets, New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming, \(\mathbb{Z}_2\mathbb{Z}_2[u^4\)-cyclic codes and their duals], On \(\mathbb{F}_2 RS\)-cyclic codes and their applications in constructing optimal codes, Linear ternary codes of strongly regular signed graphs, On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes, Constacyclic codes over mixed alphabets and their applications in constructing new quantum codes, Additive cyclic codes over mixed alphabets and the football pool problem, New parameters of subsets in polynomial association schemes, Construction of optimal ternary constant weight codes via Bhaskar Rao designs, There exists no (15,5,4) RBIBD, Semidefinite bounds for mixed binary/ternary codes, There exists no (15,5,4) RBIBD†*, New results on codes with covering radius 1 and minimum distance \(2\), Silver cubes, Fundamentals of coding type problems, New lower bounds on \(q\)-ary error-correcting codes, Quantum codes from cyclic codes over the mixed alphabet structure
