150 research outputs found
Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It is known (cf. (J. Combin. Inform. Syst. Sci.18, 1993, 161–191)) that (1) n3(6, 195) ∈ {294, 295}, n3(6, 194) ∈ {293, 294}, n3(6, 193) ∈ {292, 293}, n3(6, 192) ∈ {290, 291}, n3(6, 191) ∈ {289, 290}, n3(6, 165) ∈ {250, 251} and (2) there is a one-to-one correspondence between the set of all nonequivalent [294, 6, 195; 3]-codes meeting the Griesmer bound and the set of all {v2 + 2v3 + v4, v1 + 2v2 + v3; 5, 3}-minihypers, where vi = (3i − 1)/(3 − 1) for any integer i ≥ 0. The purpose of this paper is to show that (1) n3(6, 195) = 294, n3(6, 194) = 293, n3(6, 193) = 292, n3(6, 192) = 290, n3(6, 191) = 289, n3(6, 165) = 250 and (2) a [294, 6, 195; 3]-code is unique up to equivalence using a characterization of the corresponding {v2 + 2v3 + v4, v1 + 2v2 + v3; 5, 3}-minihypers
A construction of bent functions from plateaued functions
In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analysed. This generalizes earlier techniques for constructing bent from near-bent functions. Using this construction, we obtain a big variety of inequivalent bent functions, some weakly regular and some non-weakly regular. Classes of bent function with some additional properties that enable the construction of strongly regular graphs are constructed, and explicit expressions for bent functions with maximal degree are presented
Shuffling cards, factoring numbers, and the quantum baker's map
It is pointed out that an exactly solvable permutation operator, viewed as
the quantization of cyclic shifts, is useful in constructing a basis in which
to study the quantum baker's map, a paradigm system of quantum chaos. In the
basis of this operator the eigenfunctions of the quantum baker's map are
compressed by factors of around five or more. We show explicitly its connection
to an operator that is closely related to the usual quantum baker's map. This
permutation operator has interesting connections to the art of shuffling cards
as well as to the quantum factoring algorithm of Shor via the quantum order
finding one. Hence we point out that this well-known quantum algorithm makes
crucial use of a quantum chaotic operator, or at least one that is close to the
quantization of the left-shift, a closeness that we also explore
quantitatively.Comment: 12 pgs. Substantially elaborated version, including a new route to
the quantum bakers map. To appear in J. Phys.
An infinite family of 3-designs from Preparata codes over Z_4
We show that the support of minimum Lee weight codewords having Hamming weight 5 in the Preparata code over Z4 form a 3-(2m, 5, 10) design for any odd integer m ≥ 3.11Nscopu
On the Construction of [q4+q2-q, 5, q4-q3+q2-2q;q]-Codes Meeting the Griesmer Bound(Combinatorial Structure in Mathematical Models)
- …