New ternary linear codes
From MaRDI portal
Publication:4701434
DOI10.1109/18.771246zbMATH Open0957.94033OpenAlexW2125814644MaRDI QIDQ4701434FDOQ4701434
Authors: T. Aaron Gulliver, Rumen Daskalov, Elena Metodieva 
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.771246
Recommendations
Cited In (13)
- New quasi-twisted degenerate ternary linear codes
- Ternary linear codes and quadrics
- Title not available (Why is that?)
- Title not available (Why is that?)
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- A new iterative computer search algorithm for good quasi-twisted codes
- A search algorithm for linear codes: Progressive dimension growth
- Some new optimal ternary linear codes
- Completing the determination of the next-to-minimal weights of affine cartesian codes
- Codes over \(\mathbb F_{3} + u\mathbb F_{3}\) and improvements to the bounds on ternary linear codes
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- New linear codes over F/sub 5/ obtained by tripling method and improvements on bounds
- Title not available (Why is that?)
This page was built for publication: New ternary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701434)
