Lancaster EPrints

Low complexity trellis decoding of hamming codes.

Honary, Bahram and Markarian, Garik (1993) Low complexity trellis decoding of hamming codes. IEE Electronics Letters, 29 (12). pp. 1114-1116. ISSN 0013-5194

Full text not available from this repository.

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.

Item Type: Article
Journal or Publication Title: IEE Electronics Letters
Uncontrolled Keywords: maximum likelihood estimation ; trellis codes ; decoding ; Hamming codes
Subjects:
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 20632
Deposited By: ep_ss_importer
Deposited On: 28 Nov 2008 15:03
Refereed?: Yes
Published?: Published
Last Modified: 30 Jul 2013 11:34
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/20632

Actions (login required)

View Item