161 research outputs found
Subquadratic time encodable codes beating the Gilbert-Varshamov bound
We construct explicit algebraic geometry codes built from the
Garcia-Stichtenoth function field tower beating the Gilbert-Varshamov bound for
alphabet sizes at least 192. Messages are identied with functions in certain
Riemann-Roch spaces associated with divisors supported on multiple places.
Encoding amounts to evaluating these functions at degree one places. By
exploiting algebraic structures particular to the Garcia-Stichtenoth tower, we
devise an intricate deterministic \omega/2 < 1.19 runtime exponent encoding and
1+\omega/2 < 2.19 expected runtime exponent randomized (unique and list)
decoding algorithms. Here \omega < 2.373 is the matrix multiplication exponent.
If \omega = 2, as widely believed, the encoding and decoding runtimes are
respectively nearly linear and nearly quadratic. Prior to this work, encoding
(resp. decoding) time of code families beating the Gilbert-Varshamov bound were
quadratic (resp. cubic) or worse
A new method for constructing small-bias spaces from Hermitian codes
We propose a new method for constructing small-bias spaces through a
combination of Hermitian codes. For a class of parameters our multisets are
much faster to construct than what can be achieved by use of the traditional
algebraic geometric code construction. So, if speed is important, our
construction is competitive with all other known constructions in that region.
And if speed is not a matter of interest the small-bias spaces of the present
paper still perform better than the ones related to norm-trace codes reported
in [12]
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
A novel technique, based on the pseudo-random properties of certain graphs known as expanders, is used to obtain novel simple explicit constructions of asymptotically good codes. In one of the constructions, the expanders are used to enhance Justesen codes by replicating, shuffling, and then regrouping the code coordinates. For any fixed (small) rate, and for a sufficiently large alphabet, the codes thus obtained lie above the Zyablov bound. Using these codes as outer codes in a concatenated scheme, a second asymptotic good construction is obtained which applies to small alphabets (say, GF(2)) as well. Although these concatenated codes lie below the Zyablov bound, they are still superior to previously known explicit constructions in the zero-rate neighborhood
Explicit Non-Adaptive Combinatorial Group Testing Schemes
Group testing is a long studied problem in combinatorics: A small set of
ill people should be identified out of the whole ( people) by using only
queries (tests) of the form "Does set X contain an ill human?". In this paper
we provide an explicit construction of a testing scheme which is better
(smaller) than any known explicit construction. This scheme has \bigT{\min[r^2
\ln n,n]} tests which is as many as the best non-explicit schemes have. In our
construction we use a fact that may have a value by its own right: Linear
error-correction codes with parameters meeting the
Gilbert-Varshamov bound may be constructed quite efficiently, in \bigT{q^km}
time.Comment: 15 pages, accepted to ICALP 200
New Explicit Good Linear Sum-Rank-Metric Codes
Sum-rank-metric codes have wide applications in universal error correction
and security in multishot network, space-time coding and construction of
partial-MDS codes for repair in distributed storage. Fundamental properties of
sum-rank-metric codes have been studied and some explicit or probabilistic
constructions of good sum-rank-metric codes have been proposed. In this paper
we propose three simple constructions of explicit linear sum-rank-metric codes.
In finite length regime, numerous good linear sum-rank-metric codes from our
construction are given. Most of them have better parameters than previous
constructed sum-rank-metric codes. For example a lot of small block size better
linear sum-rank-metric codes over of the matrix size
are constructed for . Asymptotically our constructed sum-rank-metric
codes are closing to the Gilbert-Varshamov-like bound on sum-rank-metric codes
for some parameters. Finally we construct a linear MSRD code over an arbitrary
finite field with various matrix sizes
satisfying , , for any
given minimum sum-rank distance. There is no restriction on the block lengths
and parameters of these linear MSRD codes from the sizes
of the fields .Comment: 32 pages, revised version, merged with arXiv:2206.0233
Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
A method for concatenating quantum error-correcting codes is presented. The
method is applicable to a wide class of quantum error-correcting codes known as
Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate
in the Shannon theoretic sense and that are decodable in polynomial time are
presented. The rate is the highest among those known to be achievable by CSS
codes. Moreover, the best known lower bound on the greatest minimum distance of
codes constructible in polynomial time is improved for a wide range.Comment: 16 pages, 3 figures. Ver.4: Title changed. Ver.3: Due to a request of
the AE of the journal, the present version has become a combination of
(thoroughly revised) quant-ph/0610194 and the former quant-ph/0610195.
Problem formulations of polynomial complexity are strictly followed. An
erroneous instance of a lower bound on minimum distance was remove
- …