We use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of record-breaking codes. Our main theorem may be seen as a closure operation on databases. © 1997 IEEE
What is Coding Theory? Coding theory is the branch of mathematics interested in the reliable transfe...
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We...
Explicit nonasymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented...
AbstractThe paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound ...
LetA(q, n, d) denote the maximum size of a q-ary code of length n and distance d. We study the minim...
This correspondence derives a generalization of the Gilbert- Varshamov bound that is applicable to b...
AbstractThe program complexity to enumerate a finite set of words is found. The complexity is either...
Abstract. Given a linear code [n, k, d] with parity check matrix H, we provide inequality that suppo...
International audienceThe Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary ...
Let A (q, n, d) denote the maximum size of a q-ary code of length n and distance d. We study the min...
International audienceWe present one upper bound on the size of non-linear codes and its restriction...
The Gilbert-Varshamov (GV) bound is a well-known lower bound in coding theory that claims that for a...
It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high pr...
We propose a method based on cluster expansion to study the optimal code with a given distance betwe...
AbstractWe examine new approaches to the problem of decoding general linear codes under the strategi...
What is Coding Theory? Coding theory is the branch of mathematics interested in the reliable transfe...
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We...
Explicit nonasymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented...
AbstractThe paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound ...
LetA(q, n, d) denote the maximum size of a q-ary code of length n and distance d. We study the minim...
This correspondence derives a generalization of the Gilbert- Varshamov bound that is applicable to b...
AbstractThe program complexity to enumerate a finite set of words is found. The complexity is either...
Abstract. Given a linear code [n, k, d] with parity check matrix H, we provide inequality that suppo...
International audienceThe Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary ...
Let A (q, n, d) denote the maximum size of a q-ary code of length n and distance d. We study the min...
International audienceWe present one upper bound on the size of non-linear codes and its restriction...
The Gilbert-Varshamov (GV) bound is a well-known lower bound in coding theory that claims that for a...
It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high pr...
We propose a method based on cluster expansion to study the optimal code with a given distance betwe...
AbstractWe examine new approaches to the problem of decoding general linear codes under the strategi...
What is Coding Theory? Coding theory is the branch of mathematics interested in the reliable transfe...
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We...
Explicit nonasymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented...
DOI
Add to ORKG