EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 41 – 60 of 76

New Binary $[70, 35, 12]$ Self-Dual and Binary $[72, 36, 12]$ Self-Dual Doubly-Even Codes

Dontcheva, Radinka (2001)

Serdica Mathematical Journal

∗ This work was supported in part by the Bulgarian NSF under Grant MM-901/99In this paper we prove that up to equivalence there exist 158 binary [70, 35, 12] self-dual and 119 binary [72, 36, 12] self-dual doubly-even codes all of which have an automorphism of order 23 and we present their construction. All these codes are new.

Noncovering of multiples.

Torleiv Klove (1978)

Mathematica Scandinavica

Note on an Improvement of the Griesmer Bound for q-ary Linear Codes

Hamada, Noboru, Maruta, Tatsuya (2011)

Serdica Journal of Computing

Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k and d with k ≥ 3, 1 ≤ d ≤ q^(k−1) and a prime or a prime power q. The purpose of this note is to show that there exists a series of the functions h3,q, h4,q, ..., hk,q such that nq(k, d) can be expressed.This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 20540129.

On 2-ranks of Steiner triple systems.

Assmus, E.F.jun. (1995)

The Electronic Journal of Combinatorics [electronic only]

On a one-parameter family of Riordan arrays and the weight distribution of MDS codes.

Barry, Paul, Fitzpatrick, Patrick (2007)

Journal of Integer Sequences [electronic only]

On distance nonregularity of Preparata codes.

Solov'eva, F.I., Tokareva, N.N. (2007)

Sibirskij Matematicheskij Zhurnal

On Extremal Binary Doubly-Even Self-Dual Codes of Length 88*

Yorgova, Radinka, At, Nuray (2009)

Serdica Journal of Computing

In this paper we present 35 new extremal binary self-dual doubly-even codes of length 88. Their inequivalence is established by invariants. Moreover, a construction of a binary self-dual [88, 44, 16] code, having an automorphism of order 21, is given.*This work was partly supported by the Norwegian Government Scholarship.

On identifying codes in the King grid that are robust against edge deletions.

Honkala, Iiro, Laihonen, Tero (2008)

The Electronic Journal of Combinatorics [electronic only]

On McEliece's theorem.

Lomadze, N. (1997)

Georgian Mathematical Journal

On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre.

A.A. Bruen, J.A. Thas, A. Blokhuis (1988)

Inventiones mathematicae

On optimal linear codes over $𝔽_{8}$ .

Kanazawa, Rie, Maruta, Tatsuya (2011)

The Electronic Journal of Combinatorics [electronic only]

On sets of vectors of a finite vector space in which every subset of basis size is a basis

Simeon Ball (2012)

Journal of the European Mathematical Society

It is shown that the maximum size of a set $S$ of vectors of a $k$ -dimensional vector space over $𝔽_{q}$ , with the property that every subset of size $k$ is a basis, is at most $q + 1$ , if $k \leq p$ , and at most $q + k - p$ , if $q \geq k \geq p + 1 \geq 4$ , where $q = p^{k}$ and $p$ is prime. Moreover, for $k \leq p$ , the sets $S$ of maximum size are classified, generalising Beniamino Segre’s “arc is a conic” theorem. These results have various implications. One such implication is that a $k \times (p + 2)$ matrix, with $k \leq p$ and entries from $𝔽_{p}$ , has $k$ columns which are linearly dependent. Another is...

On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes

Manev, Mladen (2009)

Serdica Journal of Computing

Partially supported by the Technical University of Gabrovo under Grant C-801/2008One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values of N(T, 1, 3) are known for...

On the construction of dense lattices with a given automorphisms group

Philippe Gaborit, Gilles Zémor (2007)

Annales de l’institut Fourier

We consider the problem of constructing dense lattices in $ℝ^{n}$ with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least $c n 2^{- n}$ , which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions $n$ , we exhibit a finite set of lattices that come with an automorphisms group of size $n$ , and a constant proportion of which achieves the aforementioned lower bound on the largest packing density. The algorithmic...

On the minimum distance of ideals in group algebras

Ute Vellbinger (1996)

Acta Mathematica et Informatica Universitatis Ostraviensis

On the most weight $w$ vectors in a dimension $k$ binary code.

Kramer, Joshua Brown (2010)

The Electronic Journal of Combinatorics [electronic only]

On the structure of linear recurrent error-control codes

Michel Fliess (2002)

ESAIM: Control, Optimisation and Calculus of Variations

We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.

Currently displaying 41 – 60 of 76

Previous Page 3 Next

Displaying 41 – 60 of 76

New Binary $[70, 35, 12]$ Self-Dual and Binary $[72, 36, 12]$ Self-Dual Doubly-Even Codes

Noncovering of multiples.

Note on an Improvement of the Griesmer Bound for q-ary Linear Codes

On 2-ranks of Steiner triple systems.

On a one-parameter family of Riordan arrays and the weight distribution of MDS codes.

On distance nonregularity of Preparata codes.

On Extremal Binary Doubly-Even Self-Dual Codes of Length 88*

On identifying codes in the King grid that are robust against edge deletions.

On McEliece's theorem.

On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre.

On optimal linear codes over $𝔽_{8}$ .

On sets of vectors of a finite vector space in which every subset of basis size is a basis

On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes

On the construction of dense lattices with a given automorphisms group

On the minimum distance of ideals in group algebras

On the most weight $w$ vectors in a dimension $k$ binary code.

On the structure of linear recurrent error-control codes

On the structure of linear recurrent error-control codes

Optimal four-dimensional codes over $GF (8)$ .

Poids et équivalence des codes linéaires

Currently displaying 41 – 60 of 76