Hi,
I constructed a Sardinas-Paterson graph for the code set {1, 00, 01, 010, 110, 0010}. I need to demonstrate that the set has a unbounded deciphering delay using a cycle from the graph. Can someone help? Thanks
Printable View
Hi,
I constructed a Sardinas-Paterson graph for the code set {1, 00, 01, 010, 110, 0010}. I need to demonstrate that the set has a unbounded deciphering delay using a cycle from the graph. Can someone help? Thanks