Остановите войну!
for scientists:
default search action
Daniel J. Costello Jr.
Publications
- 1989
- [j29]Marc Rouanne, Daniel J. Costello Jr.:
An algorithm for computing the distance spectrum of trellis codes. IEEE J. Sel. Areas Commun. 7(6): 929-940 (1989) - 1988
- [j23]Marc Rouanne, Daniel J. Costello Jr.:
A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes. IEEE Trans. Inf. Theory 34(5): 1011-1020 (1988) - 1986
- [c1]Marc Rouanne, Daniel J. Costello Jr.:
A Lower Bound on the Minimum Euclidean Distance of Trellis Codes. Coding Theory and Applications 1986: 130-140 - 1984
- [j18]Richard A. Comroe, Daniel J. Costello Jr.:
ARQ Schemes for Data Transmission in Mobile Radio Systems. IEEE J. Sel. Areas Commun. 2(4): 472-481 (1984) - 1983
- [j17]Alexander Drukarev, Daniel J. Costello Jr.:
Hybrid ARQ error control using sequential decoding. IEEE Trans. Inf. Theory 29(4): 521-535 (1983) - 1982
- [j16]Alexander Drukarev, Daniel J. Costello Jr.:
A Comparison of Block and Convolutional Codes in ARQ Error Control Schemes. IEEE Trans. Commun. 30(11): 2449-2455 (1982) - 1980
- [j14]Christopher Yu, Daniel J. Costello Jr.:
Generalized minimum distance decoding algorithms for Q ary output channels (Corresp.). IEEE Trans. Inf. Theory 26(2): 238-243 (1980) - [j13]Farhad Hemmati, Daniel J. Costello Jr.:
Asymptotically catastrophic convolutional codes. IEEE Trans. Inf. Theory 26(3): 298-304 (1980) - [j12]Robert Peterson, Daniel J. Costello Jr.:
Comments on 'Convolutional tree codes for multiple access channels (Corresp.)' by Ohkubo, M. IEEE Trans. Inf. Theory 26(5): 627-628 (1980) - [j11]Roger L. Peterson, Daniel J. Costello Jr.:
Error probability and free distance bounds for two-user tree codes on multiple-access channels. IEEE Trans. Inf. Theory 26(6): 658-670 (1980) - 1979
- [j10]Roger L. Peterson, Daniel J. Costello Jr.:
Binary convolutional codes for a multiple-access channel (Corresp.). IEEE Trans. Inf. Theory 25(1): 101-105 (1979) - 1978
- [j9]Farhad Hemmati, Daniel J. Costello Jr.:
An Algebraic Construction for q-ary Shift Register Sequences. IEEE Trans. Computers 27(12): 1192-1195 (1978) - 1977
- [j7]Farhad Hemmati, Daniel J. Costello Jr.:
Truncation Error Probability in Viterbi Decoding. IEEE Trans. Commun. 25(5): 530-532 (1977) - 1971
- [j2]Daniel J. Costello Jr., Thomas N. Morrissey Jr.:
Strengthened lower bound on definite decoding minimum distance for periodic convolutional codes (Corresp.). IEEE Trans. Inf. Theory 17(2): 212-214 (1971)
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-21 17:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint