Completing codes and the Rédei property of groups

DOI10.1016/j.tcs.2006.02.002zbMath1097.68039MaRDI QIDQ2503314

Sándor Szabó

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.002

zbMATH Keywords

variable length codes; completing codes; factoring groups

Mathematics Subject Classification ID

20D60: Arithmetic and combinatorial problems involving abstract finite groups

20K01: Finite abelian groups

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

94A45: Prefix, length-variable, comma-free codes

Related Items

ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY, NONQUASI-PERIODIC FACTORIZATIONS FOR CERTAIN FINITE ABELIAN GROUPS, Complete decomposition of the generalized quaternion groups, Complete decompositions of finite abelian groups, A QUESTION CONCERNING THE FACTORIZATION OF CYCLIC GROUPS

Cites Work

• An application of Hajós factorizations to variable-length codes
• A counterexample to the triangle conjecture
• Hajós factorizations and completion of codes.
• A type of factorization of finite Abelian groups
• On the factorisation of finite abelian groups. II
• Completing codes
• On Keller's conjecture for certain cyclic groups
• Replacement of Factors By Subgroups in the Factorization of Abelian Groups
• ON A PROPERTY OF THE FACTORIZING CODES
• Unnamed Item
• Unnamed Item