NDLI: On the Construction and Dimensionality of Linear Block Code Trellises

Content Provider	IEEE Xplore Digital Library
Author	Kot, A.D. Leung, C.
Copyright Year	1993
Description	Author affiliation: University of British Columbia, Canada (Kot, A.D.)
Abstract	The trellis construction methods of Wolf [1], Massey [2], and Forey [3] for general linear block codes are briefly reviewed. An isomorphism between a. trellis constructed using Massey's method and one constructed using Wolf's method is derived. It is confirmed that Wolf's and Massey's trellis constructions also yield minimal trellises. Two simplified methods for minimal trellis construction ate presented, along with a. method to calculate the trellis dimensions that is art alternative to the methods of [2] and [3]. An improvement is found to a lower bound on the maximum trellis dimension due to Muder [4]. It is shown that when equivalent codes are constructed by permutations of the symbol positions the resulting trellis dimensions are fixed near either end, while in the central portion of the trellis the dimensions vary between an attainable upper bound and a lower bound. From the lower bound on the trellis dimensions in the central portion of the trellis it is seen that only codes (and their duals) that meet a certain condition on their minimum distances can possibly have a trellis with a relatively small number of states.
Starting Page	291
Ending Page	291
File Size	132018
Page Count	1
File Format	PDF
ISBN	0780308786
DOI	10.1109/ISIT.1993.748605
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1993-01-17
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Block codes Tail Convolutional codes Vectors Councils Scholarships Upper bound Rails Equations
Content Type	Text
Resource Type	Article

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

Block Code Based Analysis of Convolutional Codes

Convolutional codes with large slopes yield better tailbiting codes

Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds

Parallel Implementation of the Trellises for Linear Block Codes

Embedding constructions of tail-biting trellises for linear block codes

Construction of minimal tail-biting trellises

Linear Tail-Biting Trellises: Characteristic Generators and the BCJR-Construction

On the construction, dimensionality, and decoding of linear block code trellises

General structure and construction of tail biting trellises for linear block codes

On the Construction and Dimensionality of Linear Block Code Trellises

Similar Documents

Block Code Based Analysis of Convolutional Codes

Convolutional codes with large slopes yield better tailbiting codes

Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds

Parallel Implementation of the Trellises for Linear Block Codes

Embedding constructions of tail-biting trellises for linear block codes

Construction of minimal tail-biting trellises

Linear Tail-Biting Trellises: Characteristic Generators and the BCJR-Construction

On the construction, dimensionality, and decoding of linear block code trellises

General structure and construction of tail biting trellises for linear block codes

On the Construction and Dimensionality of Linear Block Code Trellises