On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code

DOI10.1109/TCOM.1987.1096783zbMATH Open0641.94009OpenAlexW2004571971MaRDI QIDQ3783201FDOQ3783201

Authors: Stavros Papastavridis 

Publication date: 1987

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1987.1096783

Recommendations

• Synchronization methods for block codes
• On the construction of maximal prefix-synchronized codes
• Extended synchronizing codewords for \(q\)-ary complete prefix codes
• scientific article; zbMATH DE number 3910298
• scientific article; zbMATH DE number 2135156

zbMATH Keywords

average number of stuffing bitsbit-stuffing techniquemean number of stuffing bitsprefix-synchronized code words

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Theory of questionnaires (94A50)

This page was built for publication: On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783201)