Some Properties of Codes with Infinite Deciphering Delay


In 2013, Tommi Lehtinen and Alexander Okhotin proved that if X is a code, then it has infinite deciphering delay if and only if there exist + ∈ A z y x , , with * , , , X zy yz xy x ∈ and * , X z y ∉ . In this paper, we give a sufficient and necessary condition for codes with infinite deciphering delay. Then, we construct two kinds of three-element codes… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.