Question

Sardinas and Patterson gave a polynomial-time algorithm to determine whether the extension of one of these constructs is non-singular, in which case a result of McMillan shows that one of these constructs satisfies Kraft’s inequality. A method to produce these constructs by iteratively partitioning elements of the source into two sets of approximately equal probability was given by (*) Fano. That method always attains a mean length within one bit of the lower bound established by Shannon’s theorem named for the “noiseless” type of these constructs, which for a binary one of these constructs is given by (-5[1])the entropy of the underlying information source. These constructs are automatically prefix-free when their namesake (-5[1])“words” all have the same length. For 10 points, name these systems used in telecoms, one of which is named after Samuel Morse. ■END■ (10[3])

ANSWER: codes [accept variable-length codes, or prefix(-free) codes, or Shannon–Fano codes, or noiseless codes; I guess prompt on answers mentioning lossless data compression]
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Rob CarsonBHSUWeird Klaus Barbie95-5
Sharath NarayanPalestrina Sawayamadoubleplusnegfive110-5
Shardul RaoOur Job is BuzzJeff Weiner Fan Club13410
Conor ThompsondoubleplusnegfivePalestrina Sawayama13410
Davis Everson-RoseWeird Klaus BarbieBHSU13410

Summary

2023 UMN COOT08/19/2023Y3100%0%67%134.00