Constant Weight Codes: A Geometric Approach Based on Dissections

M. Dehn, “Über den Rauminhalt,” Nachr. Gesell. Wiss. Göttingen, Math.-Phys. Kl. , pp. 345–354, 1900; also Math. Ann. , vol. 55, pp. 465–478, 1902

1902

Earlier work this paper cites.

J.-P. Sydler, Sur les tétraèdres équivalents à un cube, Elem. Math. , vol. 11, pp. 78–81, 1956

1956

Earlier work this paper cites.

J.-P. Sydler, “Conditions nécessaires et suffisantes pour l’équivalence des polyèdres de l’espace euclidien à trois dimensions, Comm. Math. Helv. , vol. 40, pp. 43–80, 1965

1965

Earlier work this paper cites.

B. Jessen, “The algebra of polyhedra and the Dehn-Sydler theorem,” Math. Scand. , vol. 22, pp. 241–256, 1968

1968

Earlier work this paper cites.

H. Lindgren, Geometric Dissections , Van Nostrand, Princeton, NJ, 1964; revised edition with an appendix by G. Frederickson, Dover, NY, 1972

1972

Earlier work this paper cites.

J. P. M. Schalkwijk, “An algorithm for source coding,” IEEE Trans. Inform. Theory , vol. IT-18, pp. 395–399, May 1972

1972

Earlier work this paper cites.

T. M. Cover, “Enumerative source encoding,” IEEE Trans. Inform. Theory , vol. 19, no. 1, pp. 73–77, Jan. 1973

1973

Earlier work this paper cites.

H. S. M. Coxeter, Regular Polytopes , 3rd. ed., Dover, NY, 1973

1973

Earlier work this paper cites.

V. G. Boltianskii, Hilbert’s Third Problem , Translated from the Russian by R. A. Silverman, Wiley, NY, 1978

1978

Earlier work this paper cites.

A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms , 2nd. ed., Academic Press, NY, 1978

1978

Earlier work this paper cites.

J. Rissanen, “Arithmetic codings as number representations,” in Topics in Systems Theory. Acta Polytech. Scand. Math. Comput. Sci. , vol. 31, pp. 44–51, 1979

1979

Cited alongside, same era.

J. Rissanen and G. G. Langdon, Jr., “Arithmetic coding,” IBM J. Res. Develop. , vol. 23, no. 2, pp. 149–162, 1979

1979

Cited alongside, same era.

C.-H. Sah, Hilbert’s Third Problem: Scissors Congruence , Pitman, London, 1979

1979

Cited alongside, same era.

D. K. Pradhan and J. J. Stiffler, “Error correcting codes and self-checking circuits in fault-tolerant computers,” IEEE Computer Magazine , vol. 13, pp. 27–37, Mar. 1980

1980

Cited alongside, same era.

D. T. Tang and L. S. Woo, “Exhaustive test pattern generation with constant weight vectors,” IEEE Trans. Comput. , vol. C-32, pp. 1145–1150, Dec. 1983

1983

Cited alongside, same era.

S. Verdu and V. K. Wei, “Explicit construction of optimal constant-weight codes for identification via channels,” IEEE Trans. Inform. Theory , vol. 39, pp. 30–36, Jan. 1993

1993

Later among the works it cites.

G. M. Ziegler, Lectures on Polytopes , Springer-Verlag, NY, 1995

Original

1995

Later among the works it cites.

P. R. Cromwell, Polyhedra , Cambridge Univ. Press, 1997

1997

Later among the works it cites.

G. N. Frederickson, Dissections: Plane and Fancy , Cambridge Univ. Press, 1997

1997

Later among the works it cites.

B. Grünbaum, Convex Polytopes , 2nd. ed., Springer-Verlag, NY, 2003

2003

Later among the works it cites.