Search
Now showing items 1-10 of 31
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
(2011)
A new ordering, extending the notion of universal cycles of Chung et al. (1992), is proposed for the blocks of k-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is ...
Generalization of Steane’s enlargement construction of quantum codes and applications
(2010)
We generalize Steane’s enlargement construction of binary quantum codes to q-ary quantum codes. We then apply this result to BCH codes and the study of asymptotic bounds, and obtain improvements to the quantum BCH codes ...
On self-dual cyclic codes over finite fields
(2011)
In coding theory, self-dual codes and cyclic codes are important classes of codes which have been extensively studied. The main objects of study in this paper are self-dual cyclic codes over finite fields, i.e., the ...
Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes
(2010)
In this paper, we first construct several classes of classical Hermitian self-orthogonal MDS codes. Through these classical codes, we are able to obtain various quantum MDS codes. It turns out that many of our quantum codes ...
From skew-cyclic codes to asymmetric quantum codes
(2011)
We introduce an additive but not F4-linear map S from Fn4 To F24n and exhibit some of its interesting structural properties. If C is a linear [n, k, d]4-code, then S(C) is an additive (2n, 22k, 2d)4-code. If C is an additive ...
List decodability at small radii
(2010)
A′(n, d, e), the smallest ℓ for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ℓ up to radius e, is determined for all d ≥ 2e − 3. As a result, A′(n, d, e) is ...
Association schemes arising from bent functions
(2011)
We give a construction of 3-class and 4-class association schemes from s-nonlinear and differentially 2s-uniform functions, and a construction of p-class association schemes from weakly regular p-ary bent functions, where ...
Query-efficient locally decodable codes of subexponential length
(2011)
A k-query locally decodable code (LDC) C : Σn → ΓN encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordinates of C(x), even after a constant ...
On multidimensional linear cryptanalysis
(2010)
Matsui’s Algorithms 1 and 2 with multiple approximations have been studied over 16 years. In CRYPTO’04, Biryukov et al. proposed a formal framework based on m statistically independent approximations. Started by Hermelin ...
Side-channel resistant crypto for less than 2,300 GE
(2010)
A provably secure countermeasure against first order side-channel attacks was proposed by Nikova et al. (P. Ning, S. Qing, N. Li (eds.) International conference in information and communications security. Lecture notes in ...
