An application of Hajós factorizations to variable-length codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3162956 (Why is no real title available?)
- scientific article; zbMATH DE number 3827237 (Why is no real title available?)
- scientific article; zbMATH DE number 3926268 (Why is no real title available?)
- scientific article; zbMATH DE number 3760085 (Why is no real title available?)
- scientific article; zbMATH DE number 176765 (Why is no real title available?)
- scientific article; zbMATH DE number 1254094 (Why is no real title available?)
- scientific article; zbMATH DE number 512840 (Why is no real title available?)
- scientific article; zbMATH DE number 1047871 (Why is no real title available?)
- scientific article; zbMATH DE number 1047958 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 3999313 (Why is no real title available?)
- scientific article; zbMATH DE number 3214630 (Why is no real title available?)
- scientific article; zbMATH DE number 3058897 (Why is no real title available?)
- scientific article; zbMATH DE number 3079616 (Why is no real title available?)
- scientific article; zbMATH DE number 3081728 (Why is no real title available?)
- scientific article; zbMATH DE number 3086002 (Why is no real title available?)
- A conjecture on sets of differences of integer pairs
- A counterexample to the triangle conjecture
- A note on codes having no finite completions
- A partial result about the factorization conjecture for finite variable- length codes
- A three-word code which is not prefix-suffix composed
- Completing biprefix codes
- Completing codes
- Completion of recognizable bifix codes
- Each regular code is included in a maximal regular code
- Noncommutative factorization of variable-length codes
- On a conjecture of G. Hajós
- On a variation of Sands' method
- On codes having no finite completion
- On codes having no finite completions
- On completion of codes with finite deciphering delay
- On the factorisation of finite abelian groups
- Sur certains sous-monoïdes libres
- Sur le problème de factorisation des groupes cycliques
- THE FACTORIZATION OF ABELIAN GROUPS
Cited in
(14)- Completing codes and the Rédei property of groups
- Finite maximal codes and triangle conjecture
- A partial result about the factorization conjecture for finite variable- length codes
- FINITE COMPLETIONS VIA FACTORIZING CODES
- On factorizing codes: Structural properties and related decision problems
- Abelian groups that cannot be factored without periodic factor.
- On a complete set of operations for factorizing codes
- Hajós factorizations and completion of codes.
- An enhanced property of factorizing codes
- Finite maximal codes and factorizations of cyclic groups
- A note on the factorization conjecture
- scientific article; zbMATH DE number 1400023 (Why is no real title available?)
- Hypercube 1-factorizations from extended Hamming codes
- QUASI-PERIODIC FACTORIZATIONS
This page was built for publication: An application of Hajós factorizations to variable-length codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671432)