Keyword : binary linear code


An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm
Tadashi WADAYAMA Hiroyuki KADOKAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/10/01
Vol. E85-A  No. 10 ; pp. 2196-2202
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
binary linear codeaugmentationsyndrome trellisGilbert bound
 Summary | Full Text:PDF(387.7KB)

A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms
Takuya KOUMOTO Tadao KASAMI Shu LIN 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/02/25
Vol. E81-A  No. 2 ; pp. 321-326
Type of Manuscript:  PAPER
Category: Information Theory and Coding Theory
Keyword: 
binary linear codechase algorithmiterative decodingsufficient conditionoptimality test
 Summary | Full Text:PDF(509.9KB)

Low Weight Subtrellises for Binary Linear Block Codes and Their Applications
Tadao KASAMI Takuya KOUMOTO Toru FUJIWARA Hiroshi YAMAMOTO Yoshihisa DESAKI Shu LIN 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/11/25
Vol. E80-A  No. 11 ; pp. 2095-2103
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
subtrellis diagramlow weightbinary linear coderecursive decoding algorithmsubtrellis search
 Summary | Full Text:PDF(751.6KB)