Some new results for optimal ternary linear codes
From MaRDI portal
Publication:4674485
DOI10.1109/18.992814zbMATH Open1061.94061OpenAlexW2166779920MaRDI QIDQ4674485FDOQ4674485
Authors: Juriaan Simonis, Iliya G. Bouyukliev 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.992814
Recommendations
Cited In (21)
- On optimal non-projective ternary linear codes
- On the minimum length of ternary linear codes
- Some new lower bounds for ternary covering codes
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- The nonexistence of some ternary linear codes of dimension 6
- New ternary and quaternary linear block codes
- New constructions of optimal self-dual binary codes of length 54
- Extension theorems for linear codes over finite fields
- The minimum distance of the [38,19] ternary extended QR-code is 11 (Corresp.)
- Some new results for ternary linear codes of dimension 5 and 6
- Ternary (1, 2) optimal linear codes
- Classification of Griesmer codes and dual transform
- Projective two-weight codes with small parameters and their corresponding graphs
- Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
- Some new optimal ternary linear codes
- Classification of Linear Codes by Extending Their Residuals
- New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
- Construction of self-orthogonal codes from combinatorial designs
- The nonexistence of ternary \([105,6,68]\) and \([230,6,152]\) codes
- Nonexistence of some ternary linear codes
- Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9
This page was built for publication: Some new results for optimal ternary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674485)
