On the construction of (w, r) cover-free codes

Владимир Михайлович Сидельников, O. Yu. Prikhodov · Problems of Information Transmission · 2009

We construct a new class of concatenated cover-free codes. We prove that in this class there exists a sequence of ( w, r ) cover-free codes which has a nonzero limit rate for w, r = const. We consider application of cover-free codes to key distribution systems.

Read the paper · More papers on PaperTik