On the construction of trellis codes based on (P)UM codes over Z₄

zbMATH Open0901.94031MaRDI QIDQ1925358FDOQ1925358

U. Dettmar, Ulrich Sorger, R. Kötter

Publication date: 19 August 1998

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/ppi/v31/i2/p67

zbMATH Keywords

partial unit memory codesnonlinear binary trellis codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (1)

• On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)

   Recommendations

• New trellis codes based on lattices and cosets 👍 👎
• New rotationally invariant four-dimensional trellis codes 👍 👎
• Title not available (Why is that?) 👍 👎
• Bounded minimal distance decoding of (P)UM codes based on RS codes 👍 👎

This page was built for publication: On the construction of trellis codes based on (P)UM codes over \(\mathbb Z_4\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925358)