12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Low complexity trellis decoding of hamming codes.
View graph of relations

« Back

Low complexity trellis decoding of hamming codes.

Research output: Contribution to journalJournal article

Published

Journal publication date1993
JournalElectronics Letters
Journal number12
Volume29
Number of pages3
Pages1114-1116
Original languageEnglish

Abstract

A new encoding/decoding technique for Hamming codes, based on generalised array codes (GACs) is proposed. The proposed technique allows the design of Hamming codes with minimal trellises. An example is given for the (7, 4, 3) Hamming code, but the proposed technique is applicable to all existing Hamming codes. The trellis structure of such codes provides low complexity soft maximum likelihood decoding.