The completion of very thin prefix codes with degree n

zbMATH Open1150.68379MaRDI QIDQ3501946FDOQ3501946

Authors: Hui Li Pan, Qing Zhu 

Publication date: 3 June 2008

Recommendations

• Completion of \(d\)-\(L\) prefix codes
• Combinatorial properties of codes with degree \(n\)
• Completing prefix codes in submonoids.
• Completing biprefix codes
• Completion of codes with finite bi-decoding delays.

zbMATH Keywords

prefix codesdegree of codesvery thin codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cited In (2)

• Combinatorial properties of codes with degree \(n\)
• Completion of \(d\)-\(L\) prefix codes

This page was built for publication: The completion of very thin prefix codes with degree \(n\)

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