TY - JOUR
T1 - On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes
AU - Niinomi, Toshihiro
AU - Matsushima, Toshiyasu
AU - Hirasawa, Shigeichi
PY - 2000/1/1
Y1 - 2000/1/1
N2 - The generalized proof is shown for the coding theorem of a decision feedback scheme using list decoding for tree code. DMC characterized by P = (Pij, j ∈ A, i ∈ B) and noiseless feedback is assumed. The exponents obtained has similar properties to those of the Generalized Viterbi Algorithm (GVA).
AB - The generalized proof is shown for the coding theorem of a decision feedback scheme using list decoding for tree code. DMC characterized by P = (Pij, j ∈ A, i ∈ B) and noiseless feedback is assumed. The exponents obtained has similar properties to those of the Generalized Viterbi Algorithm (GVA).
UR - http://www.scopus.com/inward/record.url?scp=0034446913&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034446913&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2000.866529
DO - 10.1109/ISIT.2000.866529
M3 - Article
AN - SCOPUS:0034446913
SN - 2157-8095
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
ER -