David M. Mandelbaum - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

1996

A Fast, Efficient Parallel-Acting Method of Generating Functions Defined by Power Series, Including Logarithm, Exponential, and Sine, CosineDavid M. Mandelbaum, Stefanie G. Mandelbaum. tpds, 7(1):33-45, 1996. [doi]

1995

Division Using a Logarithmic-Exponential Transform to Form a Short ReciprocalDavid M. Mandelbaum. TC, 44(11):1326-1330, 1995.

1993

Some Results on a SRT Type Division SchemeDavid M. Mandelbaum. TC, 42(1):102-106, 1993.

A method for calculation of the square root using combinatorial logicDavid M. Mandelbaum. vlsisp, 6(3):233-242, 1993. [doi]

1990

A Systematic Method for Division with High Average Bit SkippingDavid M. Mandelbaum. TC, 39(1):127-130, 1990.

1989

On Iterative Arrays for the Euclidean Algorithm over Finite FieldsDavid M. Mandelbaum. TC, 38(10):1473-1478, 1989.

Optimal type- B1 convolutional codes of rate 4/5David M. Mandelbaum. TIT, 35(4):900, 1989.

1988

On subsequences of arithmetic sequencesDavid M. Mandelbaum. TC, 37(10):1314-1315, 1988. [doi]

1984

Reducing the number of operations in certain finite-field transformsDavid M. Mandelbaum. TIT, 30(3):546, 1984.

An approach to an arithmetic analog of Berlekamp s algorithmDavid M. Mandelbaum. TIT, 30(5):758, 1984.

1982

Decoding of erasures and errors for certain RS codes by decreased redundancyDavid M. Mandelbaum. TIT, 28(2):330-335, 1982.

1980

On Completing Decoding of Linear Error-Correcting CodesDavid M. Mandelbaum. iandc, 47(3):195-200, December 1980.

Two applications of cyclotomic cosets to certain BCH codes (Corresp.)David M. Mandelbaum. TIT, 26(6):737-738, 1980. [doi]

1979

On Vote-Taking and Complete Decoding of Certain Error-Correcting CodesDavid M. Mandelbaum. iandc, 43(2):195-197, November 1979.

Construction of error correcting codes by interpolationDavid M. Mandelbaum. TIT, 25(1):27-35, 1979. [doi]

1978

Further results on decoding arithmetic residue codes (Corresp.)David M. Mandelbaum. TIT, 24(5):643-644, 1978. [doi]

Addition to 'A Method for Decoding of Generalized Goppa Codes'David M. Mandelbaum. TIT, 24(2):268, 1978. [doi]

1977

Decoding beyond the Designed Distance for Certain Algebraic CodesDavid M. Mandelbaum. iandc, 35(3):209-228, November 1977.

A method for decoding of generalized Goppa codes (Corresp.)David M. Mandelbaum. TIT, 23(1):137-140, 1977. [doi]

1976

On a Class of Nonlinear Arithmetic Codes that Are Easy to DecodeDavid M. Mandelbaum. iandc, 30(2):151-168, February 1976.

On a class of arithmetic codes and a decoding algorithm (Corresp.)David M. Mandelbaum. TIT, 22(1):85-88, 1976. [doi]

1975

On the derivation of Goppa codes (Corresp.)David M. Mandelbaum. TIT, 21(1):110-111, 1975. [doi]

On forward error correction with adaptive decoding (Corresp.)David M. Mandelbaum. TIT, 21(2):230-233, 1975. [doi]

1974

An adaptive-feedback coding scheme using incremental redundancy (Corresp.)David M. Mandelbaum. TIT, 20(3):388-389, 1974. [doi]

1973

Some Easily Decoded, Efficient, Burst Error Correcting Block CodesDavid M. Mandelbaum. iandc, 23(3):234-244, October 1973.

A double-phased-burst-error-correcting code of rate 1/2 (Corresp.)David M. Mandelbaum. TIT, 19(4):579-580, 1973. [doi]

Some optimal type-B1 convolutional codes (Corresp.)David M. Mandelbaum. TIT, 19(2):250-251, 1973. [doi]

1972

Some Results in Decoding of Certain Maximal-distance and BCH CodesDavid M. Mandelbaum. iandc, 20(3):232-243, April 1972.

Unequal error protection codes derived from difference sets (Corresp.)David M. Mandelbaum. TIT, 18(5):686-687, 1972. [doi]

Synchronization of codes by means of Kautz's Fibonacci encodingDavid M. Mandelbaum. TIT, 18(2):281-285, 1972. [doi]

Some classes of multiple-burst-error-correcting codes using threshold decodingDavid M. Mandelbaum. TIT, 18(2):285-292, 1972. [doi]

1971

Some Hybrid Methods for Synchronization of Cyclic CodesDavid M. Mandelbaum. iandc, 19(2):93-103, September 1971.

On decoding of Reed-Solomon codesDavid M. Mandelbaum. TIT, 17(6):707-712, 1971. [doi]

Note on Tong's burst-trapping technique (Corresp.)David M. Mandelbaum. TIT, 17(3):358-360, 1971. [doi]

1970

On Efficient Burst Correcting Residue Polynomial CodesDavid M. Mandelbaum. iandc, 16(4):319-330, June 1970.

1968

A Note on Synchronizable Error-Correcting CodesDavid M. Mandelbaum. iandc, 13(5):429-432, November 1968.

A method of coding for multiple errors (Corresp.)David M. Mandelbaum. TIT, 14(3):518-521, 1968. [doi]

1967

Arithmetic codes with large distanceDavid M. Mandelbaum. TIT, 13(2):237-242, 1967. [doi]

Sign in or sign up to see more results.

runs on WebDSL