default search action
David M. Mandelbaum
Person information
Other persons with a similar name
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
- [j38]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 Distributed Syst. 7(1): 33-45 (1996) - 1995
- [j37]David M. Mandelbaum:
Division Using a Logarithmic-Exponential Transform to Form a Short Reciprocal. IEEE Trans. Computers 44(11): 1326-1330 (1995) - 1993
- [j36]David M. Mandelbaum:
Some Results on a SRT Type Division Scheme. IEEE Trans. Computers 42(1): 102-106 (1993) - [j35]David M. Mandelbaum:
A method for calculation of the square root using combinatorial logic. J. VLSI Signal Process. 6(3): 233-242 (1993) - 1990
- [j34]David M. Mandelbaum:
A Systematic Method for Division with High Average Bit Skipping. IEEE Trans. Computers 39(1): 127-130 (1990)
1980 – 1989
- 1989
- [j33]David M. Mandelbaum:
On Iterative Arrays for the Euclidean Algorithm over Finite Fields. IEEE Trans. Computers 38(10): 1473-1478 (1989) - [j32]David M. Mandelbaum:
Optimal type- B1 convolutional codes of rate 4/5. IEEE Trans. Inf. Theory 35(4): 900- (1989) - 1988
- [j31]David M. Mandelbaum:
On subsequences of arithmetic sequences. IEEE Trans. Computers 37(10): 1314-1315 (1988) - 1984
- [j30]David M. Mandelbaum:
Reducing the number of operations in certain finite-field transforms. IEEE Trans. Inf. Theory 30(3): 546-547 (1984) - [j29]David M. Mandelbaum:
An approach to an arithmetic analog of Berlekamp's algorithm. IEEE Trans. Inf. Theory 30(5): 758-762 (1984) - 1982
- [j28]David M. Mandelbaum:
Decoding of erasures and errors for certain RS codes by decreased redundancy. IEEE Trans. Inf. Theory 28(2): 330-335 (1982) - 1980
- [j27]David M. Mandelbaum:
On Completing Decoding of Linear Error-Correcting Codes. Inf. Control. 47(3): 195-200 (1980) - [j26]David M. Mandelbaum:
Two applications of cyclotomic cosets to certain BCH codes (Corresp.). IEEE Trans. Inf. Theory 26(6): 737-738 (1980)
1970 – 1979
- 1979
- [j25]David M. Mandelbaum:
On Vote-Taking and Complete Decoding of Certain Error-Correcting Codes. Inf. Control. 43(2): 195-197 (1979) - [j24]David M. Mandelbaum:
Construction of error correcting codes by interpolation. IEEE Trans. Inf. Theory 25(1): 27-35 (1979) - 1978
- [j23]David M. Mandelbaum:
Addition to 'A Method for Decoding of Generalized Goppa Codes'. IEEE Trans. Inf. Theory 24(2): 268 (1978) - [j22]David M. Mandelbaum:
Further results on decoding arithmetic residue codes (Corresp.). IEEE Trans. Inf. Theory 24(5): 643-644 (1978) - 1977
- [j21]David M. Mandelbaum:
Decoding beyond the Designed Distance for Certain Algebraic Codes. Inf. Control. 35(3): 209-228 (1977) - [j20]David M. Mandelbaum:
A method for decoding of generalized Goppa codes (Corresp.). IEEE Trans. Inf. Theory 23(1): 137-140 (1977) - 1976
- [j19]David M. Mandelbaum:
On a Class of Nonlinear Arithmetic Codes that Are Easy to Decode. Inf. Control. 30(2): 151-168 (1976) - [j18]David M. Mandelbaum:
On a class of arithmetic codes and a decoding algorithm (Corresp.). IEEE Trans. Inf. Theory 22(1): 85-88 (1976) - 1975
- [j17]David M. Mandelbaum:
On the derivation of Goppa codes (Corresp.). IEEE Trans. Inf. Theory 21(1): 110-111 (1975) - [j16]David M. Mandelbaum:
On forward error correction with adaptive decoding (Corresp.). IEEE Trans. Inf. Theory 21(2): 230-233 (1975) - 1974
- [j15]David M. Mandelbaum:
An adaptive-feedback coding scheme using incremental redundancy (Corresp.). IEEE Trans. Inf. Theory 20(3): 388-389 (1974) - 1973
- [j14]David M. Mandelbaum:
Some Easily Decoded, Efficient, Burst Error Correcting Block Codes. Inf. Control. 23(3): 234-244 (1973) - [j13]David M. Mandelbaum:
Some optimal type-B1 convolutional codes (Corresp.). IEEE Trans. Inf. Theory 19(2): 250-251 (1973) - [j12]David M. Mandelbaum:
A double-phased-burst-error-correcting code of rate 1/2 (Corresp.). IEEE Trans. Inf. Theory 19(4): 579-580 (1973) - 1972
- [j11]David M. Mandelbaum:
Some Results in Decoding of Certain Maximal-distance and BCH Codes. Inf. Control. 20(3): 232-243 (1972) - [j10]David M. Mandelbaum:
Synchronization of codes by means of Kautz's Fibonacci encoding. IEEE Trans. Inf. Theory 18(2): 281-285 (1972) - [j9]David M. Mandelbaum:
Some classes of multiple-burst-error-correcting codes using threshold decoding. IEEE Trans. Inf. Theory 18(2): 285-292 (1972) - [j8]David M. Mandelbaum:
Unequal error protection codes derived from difference sets (Corresp.). IEEE Trans. Inf. Theory 18(5): 686-687 (1972) - 1971
- [j7]David M. Mandelbaum:
Some Hybrid Methods for Synchronization of Cyclic Codes. Inf. Control. 19(2): 93-103 (1971) - [j6]David M. Mandelbaum:
Note on Tong's burst-trapping technique (Corresp.). IEEE Trans. Inf. Theory 17(3): 358-360 (1971) - [j5]David M. Mandelbaum:
On decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 17(6): 707-712 (1971) - 1970
- [j4]David M. Mandelbaum:
On Efficient Burst Correcting Residue Polynomial Codes. Inf. Control. 16(4): 319-330 (1970)
1960 – 1969
- 1968
- [j3]David M. Mandelbaum:
A Note on Synchronizable Error-Correcting Codes. Inf. Control. 13(5): 429-432 (1968) - [j2]David M. Mandelbaum:
A method of coding for multiple errors (Corresp.). IEEE Trans. Inf. Theory 14(3): 518-521 (1968) - 1967
- [j1]David M. Mandelbaum:
Arithmetic codes with large distance. IEEE Trans. Inf. Theory 13(2): 237-242 (1967)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint