Остановите войну!
for scientists:
default search action
G. Robert Redinbo
- > Home > Persons > G. Robert Redinbo
Publications
- 2019
- [j46]G. Robert Redinbo:
Erasure Corrections in Tensor Product DFT Codes. IEEE Commun. Lett. 23(9): 1457-1461 (2019) - [j45]G. Robert Redinbo:
Tensor Product DFT Codes vs Standard DFT Codes. IEEE Trans. Computers 68(11): 1678-1688 (2019) - 2018
- [j44]G. Robert Redinbo:
Designing Checksums for Detecting Errors in Fast Unitary Transforms. IEEE Trans. Computers 67(4): 566-572 (2018) - [j43]G. Robert Redinbo:
Systematic Wavelet Codes: Designed and Decoded by DFT Vectors. IEEE Trans. Commun. 66(10): 4393-4404 (2018) - 2016
- [j42]G. Robert Redinbo:
Correcting Wavelet Codes Using Interleaving and Trapping. IEEE Trans. Signal Process. 64(5): 1216-1227 (2016) - 2014
- [j41]G. Robert Redinbo:
Correcting DFT Codes with a Modified Berlekamp-Massey Algorithm and Kalman Recursive Syndrome Extension. IEEE Trans. Computers 63(1): 196-203 (2014) - 2013
- [j40]G. Robert Redinbo:
Correcting DCT Codes With Laurent Euclidean Algorithm and Syndrome Extension. IEEE Trans. Signal Process. 61(9): 2308-2318 (2013) - 2011
- [j39]G. Robert Redinbo:
Systematic Wavelet Subcodes for Data Protection. IEEE Trans. Computers 60(6): 904-909 (2011) - [c23]G. Robert Redinbo:
Correcting DFT Codes with Modified Berlekamp-Massey Algorithm and Syndrome Extension. PRDC 2011: 272-273 - 2010
- [j38]G. Robert Redinbo:
Wavelet Codes for Algorithm-Based Fault Tolerance Applications. IEEE Trans. Dependable Secur. Comput. 7(3): 315-328 (2010) - 2009
- [j37]G. Robert Redinbo:
Wavelet Codes: Detection and Correction Using Kalman Estimation. IEEE Trans. Signal Process. 57(4): 1339-1350 (2009) - 2004
- [j33]G. Robert Redinbo:
Feedback decoding of fixed-point arithmetic convolutional codes. IEEE Trans. Commun. 52(6): 857-860 (2004) - 2003
- [j32]G. Robert Redinbo:
Failure-Detecting Arithmetic Convolutional Codes and an Iterative Correcting Strategy. IEEE Trans. Computers 52(11): 1434-1442 (2003) - 2001
- [c21]G. Robert Redinbo:
Concurrent Error Detection in Fast Unitary Transform Algorithms. DSN 2001: 37-46 - 2000
- [j30]G. Robert Redinbo:
Decoding real block codes: Activity detection Wiener estimation. IEEE Trans. Inf. Theory 46(2): 609-623 (2000) - 1999
- [c18]G. Robert Redinbo:
Hardware Fault Tolerance in Arithmetic Coding for Data Compression. PRDC 1999: 70-77 - 1998
- [j29]G. Robert Redinbo:
Generalized Algorithm-Based Fault Tolerance: Error Correction via Kalman Estimation. IEEE Trans. Computers 47(6): 639-655 (1998) - 1997
- [j27]G. Robert Redinbo:
Decoding real-number convolutional codes: Change detection, Kalman estimation. IEEE Trans. Inf. Theory 43(6): 1864-1876 (1997) - 1993
- [c14]G. Robert Redinbo:
Optimum Detector/Corrector for Fault-Tolerant Linear Processing. FTCS 1993: 299-308 - 1992
- [c13]G. Robert Redinbo:
Protecting Processing Elements in Communication Satellites. FTCS 1992: 8-17 - 1989
- [j21]G. Robert Redinbo:
System level reliability in convolution computations. IEEE Trans. Acoust. Speech Signal Process. 37(8): 1241-1252 (1989) - [c10]G. Robert Redinbo:
Data protection in convolution computations. ICASSP 1989: 1095-1098 - 1988
- [j20]G. Robert Redinbo:
Speedier decoding of cyclic codes using chord properties. IEEE Trans. Inf. Theory 34(4): 793-802 (1988) - 1987
- [j19]G. Robert Redinbo:
Fault-Tolerant Decoders for Cyclic Error-Correcting Codes. IEEE Trans. Computers 36(1): 47-63 (1987) - [j18]G. Robert Redinbo:
Finite Field Fault-Tolerant Digital Filtering Architectures. IEEE Trans. Computers 36(10): 1236-1242 (1987) - [c7]G. Robert Redinbo:
Protecting convolution-type aritmetic array calculations with generalized cyclic codes. IEEE Symposium on Computer Arithmetic 1987: 219-225 - 1986
- [c6]G. Robert Redinbo:
Fault-tolerant digital filtering structures for wafer scale VLSI. ICASSP 1986: 1189-1192 - 1985
- [j15]G. Robert Redinbo:
Optimum mean-square error use of convolutional codes. IEEE Trans. Inf. Theory 31(1): 18-33 (1985) - 1982
- [j12]G. Robert Redinbo:
On the design of mean-square error channel coding systems using cyclic codes. IEEE Trans. Inf. Theory 28(3): 406-413 (1982) - 1979
- [j11]G. Robert Redinbo:
Optimum Soft Decision Decoding With Graceful Degradation. Inf. Control. 41(2): 165-185 (1979) - [j10]G. Robert Redinbo:
Finite Field Arithmetic on an Array Processor. IEEE Trans. Computers 28(7): 461-471 (1979) - [j9]G. Robert Redinbo:
Optimum symbol-by-symbol mean-square error channel coding. IEEE Trans. Inf. Theory 25(4): 387-405 (1979) - 1978
- [c1]G. Robert Redinbo:
Channel coding considerations for digital speech encoded by linear prediction. ICASSP 1978: 466-471 - 1977
- [j8]G. Robert Redinbo:
Queueing Systems, Volume I: Theory-Leonard Kleinrock. IEEE Trans. Commun. 25(1): 178-179 (1977) - 1976
- [j7]G. Robert Redinbo:
The Optimum Mean-Square Decoding of General Block Codes. Inf. Control. 31(4): 341-363 (1976) - 1975
- [j5]G. Robert Redinbo:
Generalized bandpass filters for decoding block codes. IEEE Trans. Inf. Theory 21(4): 417-422 (1975) - 1974
- [j4]G. Robert Redinbo:
On Minimum Mean-Square Error Linear Block Codes When the Data have q-adic Weighting. Inf. Control. 26(2): 154-177 (1974) - 1973
- [j2]G. Robert Redinbo:
Bounds On the Sequency Content of the Circular Functions. IEEE Trans. Computers 22(4): 426-427 (1973) - [j1]G. Robert Redinbo:
Inequalities between the probability of a subspace and the probabilities of its cosets. IEEE Trans. Inf. Theory 19(4): 533-536 (1973)
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 2023-09-28 03:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint