Codes with bounded synchronization delay
From MaRDI portal
Publication:5601239
DOI10.1016/S0019-9958(65)90300-1zbMath0202.50404MaRDI QIDQ5601239
Solomon W. Golomb, Basil Gordon
Publication date: 1965
Published in: Information and Control (Search for Journal in Brave)
Related Items (22)
A characterization of intercodes ⋮ A completion algorithm for codes with bounded synchronization delay ⋮ On some properties of very pure codes ⋮ A survey on the local divisor technique ⋮ Completing comma-free codes ⋮ On varieties of rational languages and variable-length codes ⋮ Graded alphabets, circular codes, free Lie algebras and comma-free codes ⋮ Retrograde codes and bounded synchronization delay ⋮ Variable-length codes for error correction ⋮ T-shift synchronization codes ⋮ T-shift synchronization codes ⋮ A combinatorial property of codes having finite synchronization delay ⋮ Characterizations of \(k\)-comma codes and \(k\)-comma intercodes ⋮ Codes asynchrones ⋮ Synchronization and simplification ⋮ Generating functions of circular codes ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space ⋮ Unnamed Item ⋮ Synchronizing codewords of \(q\)-ary Huffman codes ⋮ On codes with finite interpreting delay: a defect theorem ⋮ On three-element codes ⋮ Omega-rational expressions with bounded synchronization delay
This page was built for publication: Codes with bounded synchronization delay
