Charles T. Retter

According to our database, Charles T. Retter authored at least 14 papers between 1975 and 2002.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2002

An average weight-distance enumerator for binary expansions of Reed-Solomon codes.

Charles T. Retter

IEEE Trans. Inf. Theory, 2002

1999

Spread spectrum image steganography.

Lisa M. Marvel, Charles G. Boncelet Jr., Charles T. Retter

IEEE Trans. Image Process., 1999

1998

Reliable Blind Information Hiding for Images.

Lisa M. Marvel, Charles G. Boncelet Jr., Charles T. Retter

Proceedings of the Information Hiding, 1998

Hiding Information in Images.

Lisa M. Marvel, Charles T. Retter, Charles G. Boncelet Jr.

Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

1992

Gaps in the binary weight distributions of Reed-Solomon codes.

Charles T. Retter

IEEE Trans. Inf. Theory, 1992

1991

Orthogonality of binary codes derived from Reed-Solomon codes.

Charles T. Retter

IEEE Trans. Inf. Theory, 1991

The average binary weight-enumerator for a class of generalized Reed-Solomon codes.

Charles T. Retter

IEEE Trans. Inf. Theory, 1991

1989

Intersecting Goppa codes.

Charles T. Retter

IEEE Trans. Inf. Theory, 1989

1985

A Key-Search Attack on Maclaren-Marsaglia Systems.

Charles T. Retter

Cryptologia, 1985

1984

Cryptanalysis of a Maclaren-Marsaglia System.

Charles T. Retter

Cryptologia, 1984

1976

Bounds on Goppa codes (Corresp.).

Charles T. Retter

IEEE Trans. Inf. Theory, 1976

Correcting burst and random errors with Goppa codes (Corresp.).

Charles T. Retter

IEEE Trans. Inf. Theory, 1976

1975

Bounds on Goppa codes (Ph.D. Thesis abstr.).

Charles T. Retter

IEEE Trans. Inf. Theory, 1975

Decoding Goppa codes with a BCH decoder (Corresp.).

Charles T. Retter

IEEE Trans. Inf. Theory, 1975