NDLI: Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound

Content Provider	IEEE Xplore Digital Library
Author	Johannesson, R. Wittenmark, E.
Copyright Year	1963
Abstract	For rate R=1/2 convolutional codes with 16 states there exists a gap between Heller's (1968) upper bound on the free distance and its optimal value. This article reports on the construction of 16-state, binary, rate R=2/4 nonlinear trellis and convolutional codes having d/sub free/=8; a free distance that meets the Heller upper bound. The nonlinear trellis code is constructed from a 16-state, rate R=1/2 convolutional code over Z/sub 4/ using the Gray map to obtain a binary code. Both convolutional codes are obtained by computer search. Systematic feedback encoders for both codes are potential candidates for use in combination with iterative decoding. Regarded as modulation codes for 4-PSK, these codes have free squared Euclidean distance d/sub E, free//sup 2/=16.
Sponsorship	IEEE Information Theory Society
Starting Page	1602
Ending Page	1604
Page Count	3
File Size	107431
File Format	PDF
ISSN	00189448
Volume Number	44
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Convolutional codes Upper bound Feedback Iterative decoding Binary codes Modulation coding Quadrature phase shift keying Euclidean distance Error correction codes Signal to noise ratio
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Self-concatenated trellis coded modulation with self-iterative decoding

Coding and decoding of punctured QAM trellis codes

Distance spectra and upper bounds on error probability for trellis codes

Further asymptotic upper bounds on the minimum distance of trellis codes

Two 16-state, rate trellis codes whose free distances meet the heller bound (1991).

Asymptotic Upper Bounds For Trellis Codes

Bounds on the minimum distance of trellis codes

P/sup 2/ codes: pragmatic trellis codes utilizing punctured convolutional codes

Parallel concatenated trellis coded modulation

Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound

Similar Documents

Self-concatenated trellis coded modulation with self-iterative decoding

Coding and decoding of punctured QAM trellis codes

Distance spectra and upper bounds on error probability for trellis codes

Further asymptotic upper bounds on the minimum distance of trellis codes

Two 16-state, rate trellis codes whose free distances meet the heller bound (1991).

Asymptotic Upper Bounds For Trellis Codes

Bounds on the minimum distance of trellis codes

P/sup 2/ codes: pragmatic trellis codes utilizing punctured convolutional codes

Parallel concatenated trellis coded modulation

Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound