On enumeration of nonequivalent perfect binary codes of length 15 and rank 15
5 stars based on
Olof Heden 1. Olof Heden perfect binary codes constructions properties and enumeration, Martin Hessler. On linear equivalence and Phelps codes. Advances in Mathematics of Communications, 5 3: The partial order of perfect codes associated to a perfect code. Advances in Mathematics of Communications, 1 4: Perfect and almost perfect pulse compression codes for range spread radar targets.
Olof HedenDenis S. Advances in Mathematics of Communications, 5 2: On the existence of extended perfect binary codes with trivial symmetry group. Advances in Mathematics of Communications, 3 3: Advances in Mathematics of Communications, 6 2: Thermodynamics of perfect plasticity. Perfect retroreflectors and billiard dynamics. Journal of Modern Dynamics, 5 1: An asymptotically perfect pseudorandom generator. New almost perfect, odd perfect, and perfect sequences from difference balanced functions with d -form property.
Advances in Mathematics of Communications, 11 1: Dynamics of two interacting circular cylinders in perfect fluid. Perfect binary codes constructions properties and enumeration EdelAlexander Pott. A new almost perfect nonlinear function which is not quadratic.
Advances in Mathematics of Communications, 3 1: Classification of eight-dimensional perfect forms. Electronic Research Announcements, Hybrid models for perfect complex fluids with multipolar interactions. Journal of Geometric Mechanics, 4 3: Advances in Mathematics of Communications, 10 1: On lattices, binary codes, and network codes. Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints.
Lassi Roininen perfect binary codes constructions properties and enumeration, Markku S. LehtinenPetteri PiiroinenIlkka I. Perfect radar pulse compression via unimodular fourier multipliers. Nearly perfect sequences with arbitrary out-of-phase autocorrelation. Advances in Mathematics of Communications, 10 2: American Institute of Mathematical Sciences. Previous Article On an improved correlation analysis of stream ciphers using multi-output Boolean functions and the related generalized notion of nonlinearity.
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. A survey of perfect codes. Advances in Mathematics of Communications, 2 2: