Zobrazeno 1 - 10
of 475
pro vyhledávání: '"Alexander Barg"'
Publikováno v:
Quantum, Vol 8, p 1321 (2024)
We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 1$. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some
Externí odkaz:
https://doaj.org/article/673be173a9314f2fb43bc1ce99fdcefb
Autor:
Madhura Pathegama, Alexander Barg
Publikováno v:
Entropy, Vol 25, Iss 11, p 1515 (2023)
The action of a noise operator on a code transforms it into a distribution on the respective space. Some common examples from information theory include Bernoulli noise acting on a code in the Hamming space and Gaussian noise acting on a lattice in t
Externí odkaz:
https://doaj.org/article/1eb8b146b45743ce87d325acdc474401
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2a45cc43528c6b42c590fac71abfd12
https://doi.org/10.1109/isit50566.2022.9834541
https://doi.org/10.1109/isit50566.2022.9834541
Autor:
Adway Patra, Alexander Barg
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afbaa9f0ff7768adb5a5c84c798c01aa
https://doi.org/10.1109/isit50566.2022.9834662
https://doi.org/10.1109/isit50566.2022.9834662
Publikováno v:
Discrete Mathematics. 346:113346
We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0
Comment: 21 pp
Comment: 21 pp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6bc37b10998147b85d5f3ff831e64f2
https://doi.org/10.1016/j.disc.2023.113346
https://doi.org/10.1016/j.disc.2023.113346
Publikováno v:
IEEE Transactions on Information Theory. 66:7439-7456
Recently Reed-Solomon (RS) codes were shown to possess a repair scheme that supports repair of failed nodes with optimal repair bandwidth. In this paper, we extend this result in two directions. First, we propose a new repair scheme for the RS codes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae75e1b4187482f3b02a95fc4ded222b
https://doi.org/10.1109/tit.2020.3017666
https://doi.org/10.1109/tit.2020.3017666
Autor:
Gilles Zémor, Gyula O. H. Katona, János Körner, Andrew McGregor, Ryan Gabrys, Sihem Mesnager, Olgica Milenkovic, Lara Dolecek, Alexander Barg
Publikováno v:
IEEE Transactions on Information Theory. 67:3187-3189
There are few mathematicians whose contributions go beyond named conjectures and theorems: Vladimir Iosifovich Levenshtein ( , 1935–2017) is one such true exception. During the five decades of his active research career, he enriched combinatorics,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70a332d099266a695590f87af1d03112
https://doi.org/10.1109/tit.2021.3072555
https://doi.org/10.1109/tit.2021.3072555
Publikováno v:
Scopus-Elsevier
Erasure codes in large-scale storage systems allow recovery of data from a failed node. A recently developed class of codes, locally repairable codes (LRCs), offers tradeoffs between storage overhead and repair cost. LRCs facilitate efficient recover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c19717bfbf26661b0fabcd366c46fb9f
https://doi.org/10.1145/3381832
https://doi.org/10.1145/3381832
Autor:
Alexander Barg, Zitan Chen
Publikováno v:
IEEE Transactions on Information Theory. 66:886-899
The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate freely withou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24c4512ce7c8705d4339b613e2921f8d
https://doi.org/10.1109/tit.2019.2941744
https://doi.org/10.1109/tit.2019.2941744
Autor:
Alexander Barg, Gilles Zemor
Consider an assignment of bits to the vertices of a connected graph $G(V,E)$ with the property that the value of each vertex is a function of the values of its neighbors. A collection of such assignments is called a {\em storage code} of length $|V|$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bea4630eade26d7628fecdea61ee7682
http://arxiv.org/abs/2110.02378
http://arxiv.org/abs/2110.02378
