Summary form only given. A novel binary entropy code, called combinatorial coding (CC), is presented. The theoretical basis for CC has been described previously under the context of universal coding, enumerative coding, and minimum description length. The code described in these references works as follows: assume the source data are binary of length M, memoryless, and generated with an unknown parameter /spl theta/ (the probability that a "1" occurs). The compression efficiency, and encoding and decoding speed of CC against Huffman and arithmetic coding were tested. Over the entire test, CC achieved the compression efficiency of arithmetic coding, together with the coding speed of Huffman coding.