Paper Info
Title
An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity
Abstract
Based on h reference words, Kasami et. al. proposed an integer programming problem (IPP) whose optimal value of the objective function gives a sufficient condition on the optimality of a decoded codeword. The IPP has been solved for 1 ≤ h ≤ 3. In this paper, an algorithm for solving the IPP for h = 4 is presented. The computational complexity of this algorithm is investigated.
Year
DOI
Venue
1999
10.1007/3-540-46796-3_20
AAECC
Keywords
Field
DocType
sufficient condition,kasami et,optimal value,h reference word,integer programming problem,decoded codeword,optimality testing algorithm,computational complexity,objective function,binary block codes,block codes
Discrete mathematics,Combinatorics,Binary block codes,Binary code,Block code,Algorithm,Hamming distance,Integer programming,Code word,Decoding methods,Mathematics,Computational complexity theory
Conference
Volume
ISSN
ISBN
1719
0302-9743
3-540-66723-7
Citations 
PageRank 
References 
2
0.48
5
Authors
3
Name
Order
Citations
PageRank
Yuansheng Tang182.08
Tadao Kasami2751131.11
Toru Fujiwara3237.41