- CSB - MetaPress - Google - Bing - Yahoo
 | 1996 | |
|---|---|---|
| j20 |      | David M. Mandelbaum, Stefanie G. Mandelbaum: A Fast, Efficient Parallel-Acting Method of Generating Functions Defined by Power Series, Including Logarithm, Exponential, and Sine, Cosine. IEEE Trans. Parallel Distrib. Syst. 7(1): 33-45 (1996) |
| 1995 | ||
| j19 | | David M. Mandelbaum: Division Using a Logarithmic-Exponential Transform to Form a Short Reciprocal. IEEE Trans. Computers 44(11): 1326-1330 (1995) |
| 1993 | ||
| j18 | | David M. Mandelbaum: Some Results on a SRT Type Division Scheme. IEEE Trans. Computers 42(1): 102-106 (1993) |
| j17 | | David M. Mandelbaum: A method for calculation of the square root using combinatorial logic. VLSI Signal Processing 6(3): 233-242 (1993) |
| 1990 | ||
| j16 | | David M. Mandelbaum: A Systematic Method for Division with High Average Bit Skipping. IEEE Trans. Computers 39(1): 127-130 (1990) |
| 1989 | ||
| j15 | | David M. Mandelbaum: On Iterative Arrays for the Euclidean Algorithm over Finite Fields. IEEE Trans. Computers 38(10): 1473-1478 (1989) |
| j14 | | David M. Mandelbaum: Optimal type- B1 convolutional codes of rate 4/5. IEEE Transactions on Information Theory 35(4): 900- (1989) |
| 1984 | ||
| j13 | | David M. Mandelbaum: Reducing the number of operations in certain finite-field transforms. IEEE Transactions on Information Theory 30(3): 546-547 (1984) |
| j12 | | David M. Mandelbaum: An approach to an arithmetic analog of Berlekamp's algorithm. IEEE Transactions on Information Theory 30(5): 758-762 (1984) |
| 1982 | ||
| j11 | | David M. Mandelbaum: Decoding of erasures and errors for certain RS codes by decreased redundancy. IEEE Transactions on Information Theory 28(2): 330-335 (1982) |
| 1980 | ||
| j10 | | David M. Mandelbaum: On Completing Decoding of Linear Error-Correcting Codes. Information and Control 47(3): 195-200 (1980) |
| 1979 | ||
| j9 | | David M. Mandelbaum: On Vote-Taking and Complete Decoding of Certain Error-Correcting Codes. Information and Control 43(2): 195-197 (1979) |
| 1977 | ||
| j8 | | David M. Mandelbaum: Decoding beyond the Designed Distance for Certain Algebraic Codes. Information and Control 35(3): 209-228 (1977) |
| 1976 | ||
| j7 |  | David M. Mandelbaum: On a Class of Nonlinear Arithmetic Codes that Are Easy to Decode. Information and Control 30(2): 151-168 (1976) |
| j6 | | David M. Mandelbaum: On a class of arithmetic codes and a decoding algorithm (Corresp.). IEEE Transactions on Information Theory 22(1): 85-88 (1976) |
| 1973 | ||
| j5 | | David M. Mandelbaum: Some Easily Decoded, Efficient, Burst Error Correcting Block Codes. Information and Control 23(3): 234-244 (1973) |
| 1972 | ||
| j4 | | David M. Mandelbaum: Some Results in Decoding of Certain Maximal-distance and BCH Codes. Information and Control 20(3): 232-243 (1972) |
| 1971 | ||
| j3 | | David M. Mandelbaum: Some Hybrid Methods for Synchronization of Cyclic Codes. Information and Control 19(2): 93-103 (1971) |
| 1970 | ||
| j2 | | David M. Mandelbaum: On Efficient Burst Correcting Residue Polynomial Codes. Information and Control 16(4): 319-330 (1970) |
| 1968 | ||
| j1 | | David M. Mandelbaum: A Note on Synchronizable Error-Correcting Codes. Information and Control 13(5): 429-432 (1968) |
| 1 | Stefanie G. Mandelbaum |
Data released under the ODC-BY 1.0 license — See also our legal information page