Creating Order and Ballot Sequences

DOI10.1007/978-3-642-36899-8_36zbMath1377.94022OpenAlexW183926202MaRDI QIDQ4915268

Ulrich Tamm

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_36

zbMATH Keywords

Chebyshev polynomialscreating orderpermuting channelballot sequences

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Creating order in sequence spaces with simple machines
• Lattice paths not touching a given boundary
• Optimal coding strategies for certain permuting channels
• Combinatorial structure and capacity of the permuting relay channel
• Chebychev Polynomials and Regular Polygons
• A class of convolution codes
• Random Walk and the Theory of Brownian Motion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Creating Order and Ballot Sequences