Results 1 to 10 of about 7,804,605 (312)

Optimal binary LCD codes [PDF]

open access: yesDesigns, Codes and Cryptography, 2021
19 ...
Stefka Bouyuklieva
openaire   +4 more sources

ON OPTIMAL QUANTUM CODES [PDF]

open access: yesInternational Journal of Quantum Information, 2004
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary prime power. It is shown that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≤n≤q and 1≤d≤n/2+1.
Grassl, M., Beth, T., Rötteler, M.
openaire   +3 more sources

A Family of Codes With Locality Containing Optimal Codes

open access: yesIEEE Access, 2022
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   +3 more sources

On Optimal Nonlinear Systematic Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2016
arXiv admin note: substantial text overlap with arXiv:1502 ...
Eleonora Guerrini   +2 more
openaire   +6 more sources

A Characterization of Optimal Prefix Codes

open access: yesEntropy
A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly monotone.
Spencer Congero, Kenneth Zeger
doaj   +4 more sources

Optimal Codes Correcting Localized Deletions [PDF]

open access: yesInternational Symposium on Information Theory, 2021
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of size $k$, where
Rawad Bitar   +3 more
semanticscholar   +1 more source

New Constructions of Optimal Linear Codes From Simplicial Complexes [PDF]

open access: yesIEEE Transactions on Information Theory, 2023
In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^{m}$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.
Zhao Hu   +5 more
semanticscholar   +1 more source

Optimal Codes Correcting a Burst of Deletions of Variable Length [PDF]

open access: yesInternational Symposium on Information Theory, 2020
In this paper, we present an efficiently encodable and decodable code construction that is capable of correcting a burst of deletions of length at most k.
A. Lenz, N. Polyanskii
semanticscholar   +1 more source

Two Families of Optimal Ternary Cyclic Codes With Two Zeros

open access: yesIEEE Access, 2022
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

Enumeration of Optimal Equidistant Codes

open access: yesMathematics, 2022
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

Home - About - Disclaimer - Privacy