default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan J. Ashley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2000
[j17]Jonathan J. Ashley, Maria-Pilar Bernal, Geoffrey W. Burr, Hans Coufal, Harald Guenther, John A. Hoffnagle, C. Michael Jefferson, Brian H. Marcus, Roger M. Macfarlane, Robert M. Shelby, Glenn T. Sincerbox:
Holographic data storage technology. IBM J. Res. Dev. 44(3): 341-368 (2000)- [j16]Jonathan J. Ashley, Brian H. Marcus:
Time-varying encoders for constrained systems: An approach to limiting error propagation. IEEE Trans. Inf. Theory 46(3): 1038-1043 (2000) - 1998
- [j15]Jonathan J. Ashley, Brian H. Marcus:
Two-dimensional low-pass filtering codes. IEEE Trans. Commun. 46(6): 724-727 (1998) - 1997
- [j14]Jonathan J. Ashley, Brian H. Marcus:
A generalized state-splitting algorithm. IEEE Trans. Inf. Theory 43(4): 1326-1338 (1997) - 1996
- [j13]Jonathan J. Ashley:
A linear bound for sliding-block decoder window size, II. IEEE Trans. Inf. Theory 42(6): 1913-1924 (1996) - [j12]Jonathan J. Ashley, Razmik Karabed, Paul H. Siegel:
Complexity and sliding-block decodability. IEEE Trans. Inf. Theory 42(6): 1925-1947 (1996) - [j11]Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth:
On the decoding delay of encoders for input-constrained channels. IEEE Trans. Inf. Theory 42(6): 1948-1956 (1996) - 1995
- [j10]Jonathan J. Ashley, Brian H. Marcus:
Canonical Encoders for Sliding Block Decoders. SIAM J. Discret. Math. 8(4): 555-605 (1995) - [j9]Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth:
Construction of encoders with small decoding look-ahead for input-constrained channels. IEEE Trans. Inf. Theory 41(1): 55-76 (1995) - [j8]Steven W. McLaughlin, David L. Neuhoff, Jonathan J. Ashley:
Optimal binary index assignments for a class of equiprobable scalar and vector quantizers. IEEE Trans. Inf. Theory 41(6): 2031-2037 (1995) - 1994
- [j7]Jonathan J. Ashley, Marie-Pierre Béal:
A note on the method of poles for code construction. IEEE Trans. Inf. Theory 40(2): 512-517 (1994) - 1993
- [j6]Jonathan J. Ashley, Brian H. Marcus, Dominique Perrin, Selim Tuncel:
Surjective Extensions of Sliding-Block Codes. SIAM J. Discret. Math. 6(4): 582-611 (1993) - [j5]Jonathan J. Ashley, Michael Hilden, Patrick Perry, Paul H. Siegel:
Correction to 'A note on the Shannon capacity of runlength-limited codes' (Jul 87 601-605). IEEE Trans. Inf. Theory 39(3): 1110-1112 (1993) - [j4]Jonathan J. Ashley:
Sliding block codes between constrained systems. IEEE Trans. Inf. Theory 39(4): 1303-1309 (1993) - 1988
- [j3]Jonathan J. Ashley:
A linear bound for sliding-block decoder window size. IEEE Trans. Inf. Theory 34(3): 389-399 (1988) - [j2]David C. Larson, Jonathan J. Ashley, Thomas D. Howell:
On the minimum length error event of minimum Euclidean weight. IEEE Trans. Inf. Theory 34(5): 1074-1076 (1988) - 1987
- [j1]Jonathan J. Ashley, Paul H. Siegel:
A note on the Shannon capacity of run-length-limited codes. IEEE Trans. Inf. Theory 33(4): 601-605 (1987)
Conference and Workshop Papers
- 2001
- [c3]Will G. Bliss, Razmik Karabed, KaiChi Zhang, Chandra C. Varanasi, Jonathan J. Ashley:
Sector error rate estimation of concatenated codes in magnetic recording. ICC 2001: 2726-2730 - 2000
- [c2]V. S. Gierenz, Oliver Weiss, Tobias G. Noll, I. Carew, Jonathan J. Ashley, Razmik Karabed:
A 550 Mb/s Radix-4 Bit-level Pipelined 16-State 0.25-mu m CMOS Viterbi Decoder. ASAP 2000: 195- - 1992
- [c1]Steven W. McLaughlin, Jonathan J. Ashley, David L. Neuhoff:
The Optimality of the Natural Binary Code. Coding And Quantization 1992: 95-101
Coauthor Index
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-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
