1 citations · 1 across the 4 of their papers we have counts for
4 papers
Probability of super-regular matrices and MDS codes over finite fields
Rathinakumar Appuswamy, Marco Bazzani, Spencer Congero +3
Let be an linear code chosen uniformly at random over a finite field of size . The following asymptotic probability of being maximum distance sepa…
Competitive Advantage of Huffman and Shannon-Fano Codes
Spencer Congero, Kenneth Zeger
For any finite discrete source, the competitive advantage of prefix code over prefix code is the probability produces a shorter codeword than , minus the pro…
A Characterization of Optimal Prefix Codes
Spencer Congero, Kenneth Zeger
A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly m…
Losing at Checkers is Hard
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine +2
We prove computational intractability of variants of checkers: (1) deciding whether there is a move that forces the other player to win in one move is NP-complete; (2) checkers whe…