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 the entropy of the underlying information source. These constructs are automatically prefix-free when their namesake “words” all have the same length. For 10 points, name these systems used in telecoms, one of which is named after Samuel Morse. ■END■
Buzzes
Player | Team | Opponent | Buzz Position | Value |
---|---|---|---|---|
Rob Carson | BHSU | Weird Klaus Barbie | 95 | -5 |
Sharath Narayan | Palestrina Sawayama | doubleplusnegfive | 110 | -5 |
Shardul Rao | Our Job is Buzz | Jeff Weiner Fan Club | 134 | 10 |
Conor Thompson | doubleplusnegfive | Palestrina Sawayama | 134 | 10 |
Davis Everson-Rose | Weird Klaus Barbie | BHSU | 134 | 10 |