Zobrazeno 1 - 10
of 321
pro vyhledávání: '"Ron M. Roth"'
Autor:
Giacomo Pedretti, John Moon, Pedro Bruel, Sergey Serebryakov, Ron M. Roth, Luca Buonanno, Archit Gajjar, Lei Zhao, Tobias Ziegler, Cong Xu, Martin Foltin, Paolo Faraboschi, Jim Ignowski, Catherine E. Graves
Publikováno v:
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits, Vol 10, Pp 116-124 (2024)
Structured, or tabular, data are the most common format in data science. While deep learning models have proven formidable in learning from unstructured data such as images or speech, they are less accurate than simpler approaches when learning from
Externí odkaz:
https://doaj.org/article/a602a5141d5341bda6924b89239da5ec
Autor:
Donald Mills
Publikováno v:
Cryptologia. 30:368-369
Roth, Ron M. Introduction to Coding Theory. Cambridge University Press, 40 West 20th Street, New York, NY 10011–4221, USA. 2006. 566 pp. $75.00. Roth's book, based upon lecture notes for a course o...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f16661f396a576ce7ccb27f46b2c6ffd
https://doi.org/10.1080/01611190600921041
https://doi.org/10.1080/01611190600921041
Autor:
Ron M. Roth
Publikováno v:
IEEE Transactions on Information Theory. 68:7798-7816
An improved Singleton-type upper bound is presented for the list decoding radius of linear codes, in terms of the code parameters [n,k,d] and the list size L. L-MDS codes are then defined as codes that attain this bound (under a slightly stronger not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3c98c6f43d4937869f49c73fa4127e6
https://doi.org/10.1109/tit.2022.3194521
https://doi.org/10.1109/tit.2022.3194521
Autor:
Ron M. Roth
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55488f133d315afc778d7fac8331b1ef
https://doi.org/10.1109/itw54588.2022.9965851
https://doi.org/10.1109/itw54588.2022.9965851
Autor:
Ron M. Roth
Publikováno v:
ISIT
Coding schemes are presented that provide the ability to locate computational errors above a prescribed threshold while using analog resistive devices for approximate real vector–matrix multiplication. In such devices, the matrix is programmed into
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8975ae9d55a07858dbea469803bdfdc
https://doi.org/10.1109/tit.2020.2977918
https://doi.org/10.1109/tit.2020.2977918
Autor:
Ron M. Roth
Publikováno v:
ISIT
New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality over a finite field $F$. The bounds apply to LRCs in which the recovery functions are linea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed50525d157b41c9ac44d3e61af764d2
https://doi.org/10.1109/isit45174.2021.9518239
https://doi.org/10.1109/isit45174.2021.9518239
Autor:
Ron M. Roth
Publikováno v:
IEEE Transactions on Information Theory. 65:2046-2057
Coding schemes are presented that provide the ability to correct and detect computational errors while using dot-product engines for integer vector–matrix multiplication. Both the $L_{1}$ -metric and the Hamming metric are considered.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d77468b9f492c573171f8bd74c774c2d
https://doi.org/10.1109/tit.2018.2869794
https://doi.org/10.1109/tit.2018.2869794
Publikováno v:
2020 IEEE International Electron Devices Meeting (IEDM).
Despite great promises shown in the laboratory environment, memristor crossbar, or non-volatile resistive analog memory, based matrix multiplication accelerators suffer from unexpected computing errors, limiting opportunities to replace main-stream d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecfe7e13008b7b141d8745c9af1622ba
https://doi.org/10.1109/iedm13553.2020.9371978
https://doi.org/10.1109/iedm13553.2020.9371978
Autor:
Rachel N. Berman, Ron M. Roth
Publikováno v:
ISIT
Motivated by coding applications, two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF ( q ) , and the number of ways a polynomial can be written as a product of two polynomials of degree at mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6121a3340135034ca04caf175f78545
https://doi.org/10.1109/isit44484.2020.9174405
https://doi.org/10.1109/isit44484.2020.9174405
Autor:
Ron M. Roth, Paul H. Siegel
Publikováno v:
ISIT
Previous work by the authors on parity-preserving fixed-length constrained encoders is extended to the variable-length case. Parity-preserving variable-length encoders are formally defined, and a necessary and sufficient condition is presented for th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6241baa0e3f2d053b9bdc8d67a29e2e0
https://doi.org/10.1109/isit44484.2020.9174067
https://doi.org/10.1109/isit44484.2020.9174067