Work

Searching for tailbiting codes with large minimum distances

Year: 2002

Type: conference-paper

Abstract: Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. A new lower bound on the maximal state complexity of an arbitrary tailbiting code is derived. The asymptotic behavior of the derived bound is investigated. Some new tailbiting representations for linear block codes of rates R=1/c, c=2,3,4 are presented.

Source: IEEE International Symposium on Information Theory (ISIT)

DOI: 10.1109/isit.2000.866639

Authors: I.E. Bocharova, B.D. Kudryashov, R. Johannesson, P. Stahl

Institutions: Saint Petersburg State University of Aerospace and Instrumentation, Lund University

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2107804301

FWCI: 0.185

Cites: 2

Cited by: 5

Related to: 10