TY - JOUR

T1 - Low-complexity trellis decoding of linear block codes.

AU - Honary, B.

AU - Markarian, G. S.

AU - Darnell, M.

N1 - "©1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." "This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."

PY - 1995

Y1 - 1995

N2 - The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to the trellises of coset codes and allow low complexity soft maximum likelihood decoding.

AB - The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to the trellises of coset codes and allow low complexity soft maximum likelihood decoding.

M3 - Journal article

VL - 142

SP - 201

EP - 209

JO - IEE Proceedings - Communications

JF - IEE Proceedings - Communications

IS - 4

ER -