Marcus Greferath

Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code

Using tensor product constructions for the first-order generalized Reed-Muller codes, we extend the well-established concept of the Gray isometry between (Z/sub 4/, /spl delta//sub L/) and (Z/sub 2//sup 2/, /spl delta//sub H/) to the context of finite chain rings. Our approach covers previous results by Carlet (see ibid., vol.44, p.1543-7, 1998), Constantinescu (see Probl. Pered. Inform., vol.33, no.3, p.22-8, 1997 and Ph.D. dissertation, Tech. Univ. Munchen, Munchen, Germany, 1995), Nechaev et al. (see Proc. IEEE Int. Symp. Information Theory and its Applications, p.31-4, 1996) and overlaps with Heise et al. (see Proc. ACCT 6, Pskov, Russia, p.123-9, 1998) and Honold et al. (see Proc. ACCT 6, Pskov, Russia, p.135-41, 1998). Applying the Gray isometry on Z/sub 9/ we obtain a previously unknown nonlinear ternary (36, 3/sup 12/, 15) code.

Linear-Programming Decoding of Nonbinary Linear Codes

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates LP-based reception for coded modulation systems which use direct modulation mapping of coded symbols. It is proved that the resulting LP decoder has the ldquomaximum-likelihood (ML) certificaterdquo property. It is also shown that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. It is also proved that if the modulator-channel combination satisfies a particular symmetry condition, the codeword error rate performance is independent of the transmitted codeword. Two alternative polytopes for use with LP decoding are studied, and it is shown that for many classes of codes these polytopes yield a complexity advantage for decoding. These polytope representations lead to polynomial-time decoders for a wide variety of classical nonbinary linear codes. LP decoding performance is illustrated for ternary Golay code with ternary phase-shift keying (PSK) modulation over additive white Gaussian noise (AWGN), and in this case it is shown that the performance of the LP decoder is comparable to codeword-error-rate-optimum hard-decision-based decoding. LP decoding is also simulated for medium-length ternary and quaternary low-density parity-check (LDPC) codes with corresponding PSK modulations over AWGN.

NMR with excitation modulated by Frank sequences

Miniaturized NMR is of growing importance in bio-, chemical, and -material sciences. Other than the magnet, bulky components are the radio-frequency power amplifier and the power supply or battery pack. We show that constant flip-angle excitation with phase modulation following a particular type of polyphase perfect sequences results in low peak excitation power at high response peak power. It has ideal power distribution in both the time domain and the frequency domain. A savings in peak excitation power of six orders of magnitude has been realized compared to conventionally pulsed excitation. Among others, the excitation promises to be of use for button-cell operated miniature NMR devices as well as for complying with specific-absorption-rate regulations in high-field medical imaging.

The linear programming bound for codes over finite Frobenius rings

In traditional algebraic coding theory the linear-programming bound is one of the most powerful and restrictive bounds for the existence of both linear and non-linear codes. This article develops a linear-programming bound for block codes on finite Frobenius rings.

Efficient decoding of Z/sub p/k-linear codes

We present a method for lifting a decoding scheme for a linear code over Z/sub p/ to a decoding scheme for a linear code over Z/sub p/k and characterize the class of codes for which this kind of lifting works. Its interest lies in its great generality and efficiency.

Cyclic codes over finite rings

Abstract It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x n − 1 in F [ x ]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite rings and proves the above characterization to be true for a large class of such codes over these rings.

A unified approach to projective lattice geometries

The interest in pursuing projective geometry on modules has led to several lattice theoretic generalizations of the classical synthetic concept of projective geometry on vector spaces.Introduced in this paper is an approach that is capable of unifying various attempts within a new conceptual frame. This approach reflects algebraic properties from a lattice-geometric point of view. Together with new results we are presenting results from previous publications which have been improved in the frame of this work.

Projective Geometry on Modular Lattices

Publisher Summary This chapter focuses on projective geometry on modular lattices. Incidence and Order are basic concepts for a foundation of modern synthetic geometry. These concepts describe the relative location or containment of geometric objects and have led to different lines of geometry, an incidence-geometric and a lattice-theoretic one. Modularity is one of the fundamental properties of classical projective geometry. It makes projections into join-preserving mappings and yields perspectivities to be (interval) isomorphisms. It is therefore natural that order-theoretic generalizations of projective geometry are based on modular lattices and even more, the theory of modular lattices may be considered as a most general concept of projective geometry. In particular, the partially ordered set of all submodules of a module forms a (complete) modular lattice; even more general, any sublattice of the lattice of all normal subgroups of a group is a modular lattice. It considers that lattice-geometric approaches are complete geometrical structures whose geometrical objects form complete (modular) lattices.

Characteristics of invariant weights related to code equivalence over rings

The Equivalence Theorem states that, for a given weight on an alphabet, every isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams’ Equivalence Theorem for the Hamming weight on codes over finite fields. The question remains: What conditions must a weight satisfy so that the Extension Theorem will hold? In this paper we provide an algebraic framework for determining such conditions, generalising the approach taken in Greferath and Honold (Proceedings of the Tenth International Workshop in Algebraic and Combinatorial Coding Theory (ACCT-10), pp. 106–111. Zvenigorod, Russia, 2006).

On two doubly even self-dual binary codes of length 160 and minimum weight 24

This correspondence revisits the idea of constructing a binary [mn,mk] code from an [n,k] code over F/sub 2//sup m/ by concatenating the code with a suitable basis representation of F/sub 2//sup m/ over F/sub 2/. We construct two nonequivalent examples of doubly even self-dual binary codes of length 160 which turn out to be of minimum distance 24. This improves the lower bound for this class of codes, whereas the upper bound is given by 28. The construction at hand seems to be of interest beyond this particular example.