Several families of binary cyclic codes with good parameters

Z Sun - Finite Fields and Their Applications, 2023 - Elsevier
Binary odd-like duadic codes have parameters [n,(n+ 1)/2], where n is odd. It is well known
that the minimum odd weight of odd-like duadic codes has the lower bound n. The binary …

New quantum codes from self-dual codes over

R Dastbasteh, P Lisoněk - Designs, Codes and Cryptography, 2024 - Springer
We present new constructions of binary quantum codes from quaternary linear Hermitian
self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal …

[PDF][PDF] New quantum codes, minimum distance bounds, and equivalence of codes

R Dastbasteh - 2023 - summit.sfu.ca
Quantum error-correcting codes (quantum codes) are applied to protect quantum
information from errors caused by noise (decoherence) on the quantum channel in a way …

Genetic algorithms for finding the weight enumerator of binary linear block codes

S Nouh, M Belkasmi - arxiv preprint arxiv:1303.4227, 2013 - arxiv.org
In this paper we present a new method for finding the weight enumerator of binary linear
block codes by using genetic algorithms. This method consists in finding the binary weight …

Binary self-dual codes with automorphisms of order 23

R Yorgova, A Wassermann - Designs, Codes and Cryptography, 2008 - Springer
The only example of a binary doubly-even self-dual [120, 60, 20] code was found in 2005 by
Gaborit et al.(IEEE Trans Inform theory 51, 402–407 2005). In this work we present 25 new …

Several families of q-ary cyclic codes with length

J Li, H Zhu, S Huang - Cryptography and Communications, 2024 - Springer
It is very hard to construct an infinite family of cyclic codes of rate close to one half whose
minimum distances have a good bound. Tang-Ding codes are very interesting, as their …

Binary duadic codes and their related codes with a square-root-like lower bound

T Wu, L Li, X Zhang, S Zhu - arxiv preprint arxiv:2404.18053, 2024 - arxiv.org
Binary cyclic codes have been a hot topic for many years, and significant progress has been
made in the study of this types of codes. As is well known, it is hard to construct infinite …

Some results on the weight distributions of the binary double-circulant codes based on primes

C Tjhai, M Tomlinson, R Horan… - 2006 10th IEEE …, 2006 - ieeexplore.ieee.org
This paper presents a more efficient algorithm to count codewords of given weights in self-
dual double-circulant and formally self-dual quadratic double-circulant codes over GF (2). A …

On the minimum weights of binary extended quadratic residue codes

WK Su, PY Shih, TC Lin… - 2009 11th International …, 2009 - ieeexplore.ieee.org
This paper used an efficient scheme to determine the number of codewords for a given
weight in the binary extended quadratic residue code. The scheme consists of a weight …

New doubly even self-dual codes having minimum weight 20

M Harada - arxiv preprint arxiv:1902.08739, 2019 - arxiv.org
arxiv:1902.08739v1 [math.CO] 23 Feb 2019 New doubly even self-dual codes having minimum
weight 20 Page 1 arxiv:1902.08739v1 [math.CO] 23 Feb 2019 New doubly even self-dual …