Results 1 to 10 of about 179,694 (118)
Enumeration of Optimal Equidistant Codes
Problems of search and enumeration of binary and ternary equidistant codes are considered in the paper. We investigate some combinatorial algorithms and develop specialized computer packages to find non-equivalent optimal binary and ternary equidistant ...
Galina Bogdanova, Todor Todorov
doaj +1 more source
Two Families of Optimal Ternary Cyclic Codes With Two Zeros
Cyclic codes are an important subclass of linear codes and have wide applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms.
Jinmei Fan, Binseng Wang
doaj +1 more source
Hamming Distance of Constacyclic Codes of Length
Let $p$ be any prime, $s$ and $m$ be positive integers. In this paper, we completely determine the Hamming distance of all constacyclic codes of length $p^s$ over the finite commutative chain ring $\mathbb {F}_{p^m}+ u\mathbb {F}_{p^m} + u^{2 ...
Hai Q. Dinh +3 more
doaj +1 more source
Self-Dual Codes, Symmetric Matrices, and Eigenvectors
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ using symmetric matrices and eigenvectors from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$ . Using this method, which is called a
Jon-Lark Kim, Whan-Hyuk Choi
doaj +1 more source
Some Results on Self-Complementary Linear Codes
Binary codes have a special place in coding theory since they are one of the most commonly used in practice. There are classes of codes specific only to the binary case. One such class is self-complementary codes.
Maria Pashinska-Gadzheva +2 more
doaj +1 more source
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩
Let Z = Fpm[u]/(u3) be the finite commutative chain ring, where p is a prime, m is a positive integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over Z and their ...
Tania Sidana, Anuradha Sharma
doaj +1 more source
A Family of Codes With Locality Containing Optimal Codes
Locally recoverable codes were introduced by Gopalan et al. in 2012, and in the same year Prakash et al. introduced the concept of codes with locality, which are a type of locally recoverable codes.
Bruno Andrade +3 more
doaj +1 more source
Optimal Narain CFTs from codes
Recently established connection between additive codes and Narain CFTs provides a new tool to construct theories with special properties and solve modular bootstrap constraints by reducing them to algebraic identities.
Nikolaos Angelinos +2 more
doaj +1 more source
BVPs Codes for Solving Optimal Control Problems
Optimal control problems arise in many applications and need suitable numerical methods to obtain a solution. The indirect methods are an interesting class of methods based on the Pontryagin’s minimum principle that generates Hamiltonian Boundary Value ...
Francesca Mazzia, Giuseppina Settanni
doaj +1 more source
Optimal Locally Repairable Codes for Parallel Reading
Locally repairable codes (LRCs) have important applications in distributed storage systems. In this paper, we study q-ary [n, k, d] LRCs with (r, t, δ)-information-locality, where each of the i-th (1 ≤ i ≤ k) information symbol is ...
Jie Hao +3 more
doaj +1 more source

