Emina Soljanin, Elke Offer. Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees. Discrete Applied Mathematics, 128(1):293-303, 2003. [doi]
@article{SoljaninO03,
title = {Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees},
author = {Emina Soljanin and Elke Offer},
year = {2003},
doi = {10.1016/S0166-218X(02)00452-3},
url = {http://dx.doi.org/10.1016/S0166-218X(02)00452-3},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/SoljaninO03},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {128},
number = {1},
pages = {293-303},
}