The problem of dissecting a tetrahedron and reassembling the pieces to 
form a hyper-rectangle or brick arises very naturally while trying to encode 
binary vectors of constant Hamming weight. Polyhedral dissections are of 
great interest to geometers. In 1985 Schobi discovered a beautiful three- 
piece dissection of the simplex with vertices 000, 100,110, 111 to a triangular 
prism. This dissection is very relevant to the our encoding problem and a 
generalization of this construction to n >3 dimensions will be described 
along with encoding and decoding algorithms. The talk will end with some 
observations about connections to other areas of information theory.