Coding and Cryptography

DOI10.1007/11779360zbMath1151.94648arXivcs/0508055OpenAlexW2504517155MaRDI QIDQ5899180

No author found.

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0508055

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Genetics and epigenetics (92D10) Combinatorial codes (94B25)

Related Items (20)

A class of linear codes with their complete weight enumerators over finite fields ⋮ Complete weight enumerators of some linear codes and their applications ⋮ DNA codes over two noncommutative rings of order four ⋮ Reversible complement cyclic codes over Galois rings with application to DNA codes ⋮ A study of primer design with \(w\)-constacyclic shift over \(\mathbb{F}_4\) ⋮ On reversible codes over a non-chain ring ⋮ Unnamed Item ⋮ A new construction for \(q\)-ary constant weight codes ⋮ Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing ⋮ Room squares with super-simple property ⋮ Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\) ⋮ Cyclic DNA codes over the ring \(F_2[u/(u^2-1)\) based on the deletion distance] ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ DNA cyclic codes over the ring 𝔽2[u,v/〈u2 − 1,v3 − v,uv − vu〉] ⋮ DNA cyclic codes over rings ⋮ Dipole codes attractively encode glue functions ⋮ Greedy construction of DNA codes and new bounds ⋮ Lexicodes over finite principal ideal rings ⋮ DNA computing over the ring ℤ4[v/〈v2 − v〉]

This page was built for publication: Coding and Cryptography