scientific article; zbMATH DE number 7326416
From MaRDI portal
Publication:5855731
zbMath1478.94119MaRDI QIDQ5855731
Elena Metodieva, Rumen N. Daskalov
Publication date: 19 March 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- Some new quasi-twisted ternary linear codes
- A new iterative computer search algorithm for good quasi-twisted codes
- Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
- An algorithm for generating necklaces of beads in two colors
- Optimal ternary quasi-cyclic codes
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Bounds on minimum distance for linear codes over GF(5)
- New minimum distance bounds for linear codes over GF(5).
- New linear codes from constacyclic codes
- New binary linear codes from quasi-cyclic codes and an augmentation algorithm
- New one-generator quasi-cyclic codes over \(\text{GF}(7)\)
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- The nonexistence of ternary \([105,6,68\) and \([230,6,152]\) codes]
- Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- Quasi-Cyclic Codes over $\mathbb{F}_{13}$
- Generating necklaces
- Improved bounds for ternary linear codes of dimension 7
- New good quasi-cyclic ternary and quaternary linear codes
- The intractability of computing the minimum distance of a code
- The nonexistence of some five-dimensional quaternary linear codes
- The structure of 1-generator quasi-twisted codes and new linear codes
This page was built for publication:
