Tournament Coding of Integer Sequences

DOI10.1093/COMJNL/BXN030zbMATH Open1373.94878OpenAlexW2053784187MaRDI QIDQ3568487FDOQ3568487

Authors: Jukka Teuhola 

Publication date: 14 June 2010

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/bxn030

Recommendations

• Computing tournament sequence numbers efficiently with matrix techniques
• scientific article; zbMATH DE number 7732125
• Tournament sequences and Meeussen sequences
• Binary covering arrays on tournaments
• Score sequences of bitournaments
• Counting tournament score sequences
• A lower bound for 0,1,* tournament codes
• Score sequences: Lexicographic enumeration and tournament construction
• An algorithm to generate tournament score sequences

zbMATH Keywords

data compressionsource codinginterpolative coding

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (1)

• Computing tournament sequence numbers efficiently with matrix techniques

This page was built for publication: Tournament Coding of Integer Sequences

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