3 papers
cs.IT2026
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…
cs.IT2024
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…
cs.IT2024
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…