## Journals

- Advances in Mathematics of Communications
- Big Data & Information Analytics
- Communications on Pure & Applied Analysis
- Discrete & Continuous Dynamical Systems - A
- Discrete & Continuous Dynamical Systems - B
- Discrete & Continuous Dynamical Systems - S
- Evolution Equations & Control Theory
- Inverse Problems & Imaging
- Journal of Computational Dynamics
- Journal of Dynamics & Games
- Journal of Geometric Mechanics
- Journal of Industrial & Management Optimization
- Journal of Modern Dynamics
- Kinetic & Related Models
- Mathematical Biosciences & Engineering
- Mathematical Control & Related Fields
- Mathematical Foundations of Computing
- Networks & Heterogeneous Media
- Numerical Algebra, Control & Optimization
- AIMS Mathematics
- Conference Publications
- Electronic Research Announcements
- Mathematics in Engineering

### Open Access Journals

AMC

It is clarified whether or not ''full rank perfect 1-error correcting binary codes act like primes in the family of all perfect 1-error correcting binary codes''. Thereby the well known connection between perfect 1-error correcting binary codes and tilings will be discussed and used.

AMC

We investigate partitions of the set $\mathbb F$

^{n}of all binary vectors of length $n$ into cosets of pairwise distinct linear Hamming codes (''non-parallel Hamming codes'') of length $n$. We present several constructions of partitions of $\mathbb F$^{n}into non-parallel Hamming codes of length $n$ and discuss a lower bound on the number of different such partitions.
AMC

The Krotov combining construction of perfect $1$-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect $1$-error-correcting binary code can be constructed by this combining construction is generalized to the $q$-ary case. Simply speaking, every non-full-rank perfect code $C$ is the union of a well-defined family of $\bar\mu$-components

*K*_{$\bar\mu$}, where $\bar\mu$ belongs to an “outer” perfect code*C*^{*}, and these components are at distance three from each other. Components from distinct codes can thus freely be combined to obtain new perfect codes. The Phelps general product construction of perfect binary code from 1984 is generalized to obtain $\bar\mu$-components, and new lower bounds on the number of perfect $1$-error-correcting $q$-ary codes are presented.
AMC

The first examples of perfect $e$-error correcting $q$-ary codes were given in the 1940's by Hamming and Golay. In 1973 Tietäväinen, and independently Zinoviev and Leontiev, proved that if q is a power of a prime number then there are no unknown multiple error correcting perfect $q$-ary codes. The
case of single error correcting perfect codes is quite different. The number of different such codes is very large and the classification, enumeration and description of all perfect 1-error correcting codes is still an open problem.

This survey paper is devoted to the rather many recent results, that have appeared during the last ten years, on perfect 1-error correcting binary codes. The following topics are considered: Constructions, connections with tilings of groups and with Steiner Triple Systems, enumeration, classification by rank and kernel dimension and by linear equivalence, reconstructions, isometric properties and the automorphism group of perfect codes.

This survey paper is devoted to the rather many recent results, that have appeared during the last ten years, on perfect 1-error correcting binary codes. The following topics are considered: Constructions, connections with tilings of groups and with Steiner Triple Systems, enumeration, classification by rank and kernel dimension and by linear equivalence, reconstructions, isometric properties and the automorphism group of perfect codes.

keywords:
Perfect codes.

AMC

A new class of perfect 1-error correcting binary codes, so called RRH-codes, are identified, and it is shown that every such code is linearly equivalent to a perfect code obtainable by the Phelps construction.

AMC

It is shown that all non-full-rank

*FRH-codes*, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.
AMC

The set of permutations of the coordinate set that maps a perfect code $C$ into itself is called the symmetry group of $C$ and is denoted by Sym$(C)$. It is proved that for all integers $n=2^m-1$, where $m=4,5,6,...$, and for any integer $r$, where $n-$log$(n+1)+3\leq r\leq n-1$, there are perfect codes of length $n$ and rank $r$ with a trivial symmetry group, i.e. Sym$(C)=${id}. The result is shown to be true, more generally, for the extended perfect codes of length $n+1$.

AMC

It is proved that for every integer $n=2^k-1$, with $k\geq5$, there exists a perfect code $C$ of length $n$, of rank
$r=n-\log(n+1)+2$ and with a trivial symmetry group. This result extends an earlier result by the authors that says that for any length
$n=2^k-1$, with $k\geq5$, and any rank $r$, with $n-\log(n+1)+3\leq r\leq n-1$ there exist perfect codes with a trivial symmetry group.

## Year of publication

## Related Authors

## Related Keywords

[Back to Top]