TY - GEN
T1 - Information-theoretic bounds on trellis complexity of nonlinear codes
AU - Reuven, Ilan
AU - Be'Ery, Yair
PY - 1997
Y1 - 1997
N2 - Information-theoretic measures are used to derive both upper and lower bounds on the state complexity and on the branch complexity of nonlinear block codes To the best of our knowledge, the proposed upper bounds are the only upper bounds that address nonlinear codes. The improvement of the novel lower bounds is twofold: these bounds are tighter than the existing bounds and they also bound the trellis complexity of improper and unobservable trellis diagrams, unlike the existing bounds.
AB - Information-theoretic measures are used to derive both upper and lower bounds on the state complexity and on the branch complexity of nonlinear block codes To the best of our knowledge, the proposed upper bounds are the only upper bounds that address nonlinear codes. The improvement of the novel lower bounds is twofold: these bounds are tighter than the existing bounds and they also bound the trellis complexity of improper and unobservable trellis diagrams, unlike the existing bounds.
UR - http://www.scopus.com/inward/record.url?scp=0030650961&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1997.612998
DO - 10.1109/ISIT.1997.612998
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0030650961
SN - 0780339568
SN - 9780780339569
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 83
BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Y2 - 29 June 1997 through 4 July 1997
ER -