Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Iwan Duursma"'
Autor:
Iwan Duursma, Hsin-Po Wang
Publikováno v:
IEEE Transactions on Information Theory. 67:1509-1521
A pruned variant of polar coding is proposed for binary erasure channels. For sufficiently small $\varepsilon>0$, we construct a series of capacity achieving codes with block length $N=\varepsilon^{-5}$, code rate $R=\text{Capacity}-\varepsilon$, err
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fbfc65ec594c1227b40e34c94c0e6f0
https://doi.org/10.1109/tit.2020.3041523
https://doi.org/10.1109/tit.2020.3041523
Publikováno v:
Designs, Codes and Cryptography. 88:1617-1638
Consider a complete flag $\{0\} = C_0 < C_1 < \cdots < C_n = \mathbb{F}^n$ of one-point AG codes of length $n$ over the finite field $\mathbb{F}$. The codes are defined by evaluating functions with poles at a given point $Q$ in points $P_1,\dots,P_n$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::800a99324590ecd877f5ba074ee2b10e
https://doi.org/10.1007/s10623-020-00752-9
https://doi.org/10.1007/s10623-020-00752-9
Autor:
Iwan Duursma, Hsin-Po Wang
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing.
An $$(n, k, d, \alpha )$$ -MSR (minimum storage regeneration) code is a set of n nodes used to store a file. For a file of total size $$k\alpha$$ , each node stores $$\alpha$$ symbols, any k nodes determine the file, and any d nodes can repair any ot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dd9516ce88f8d7530cd00259ac537ca
https://doi.org/10.1007/s00200-021-00526-3
https://doi.org/10.1007/s00200-021-00526-3
Autor:
Iwan Duursma
Publikováno v:
Designs, Codes and Cryptography. 87:2507-2536
Trellises provide a graphical representation for the row space of a matrix. The product construction of Kschischang and Sorokine builds minimal conventional trellises from matrices in minimal span form. Koetter and Vardy showed that minimal tail-biti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36e57247e48f15bda519865a23199935
https://doi.org/10.1007/s10623-019-00627-8
https://doi.org/10.1007/s10623-019-00627-8
Autor:
Iwan Duursma
Publikováno v:
IEEE Transactions on Information Theory. 65:1000-1007
For general exact repair regenerating codes, the optimal trade-offs between the storage size and repair bandwidth remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument, we identify nonneg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93feb62190b9d781d4564c24ab039162
https://doi.org/10.1109/tit.2018.2840995
https://doi.org/10.1109/tit.2018.2840995
Publikováno v:
IEEE Transactions on Information Theory. 65:118-130
We study the problem of constructing balanced generator matrices for Reed–Solomon and Tamo–Barg codes. More specifically, we are interested in realizing generator matrices, for the full-length cyclic versions of these codes, where all rows have t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::314b92d9825de03a127bf4c24a482a7d
https://doi.org/10.1109/tit.2018.2873128
https://doi.org/10.1109/tit.2018.2873128
An $(n, k, d, \alpha, \beta, M)$-ERRC (exact-repair regenerating code) is a collection of $n$ nodes used to store a file. For a file of total size $M$, each node stores $\alpha$ symbols, any $k$ nodes recover the file, and any $d$ nodes repair any ot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7966f46d6b53efeaa40b09eba23722fb
Publikováno v:
IEEE Transactions on Information Theory. 64:6567-6582
Despite their exceptional error-correcting properties, Reed-Solomon codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd8484cbbff0812b2ceadcf89c3e9983
https://doi.org/10.1109/tit.2018.2827942
https://doi.org/10.1109/tit.2018.2827942
Autor:
Hsin-Po Wang, Iwan Duursma
Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively, for any c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9916765f2b98777483a275a2fb195005
http://arxiv.org/abs/1912.08995
http://arxiv.org/abs/1912.08995
Autor:
Iwan Duursma, Xiao Li
We define a Johnson graph code as a subspace of labelings of the vertices in a Johnson graph with the property that labelings are uniquely determined by their restriction to vertex neighborhoods specified by the parameters of the code. We give a cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04d3906cacd2c9c6656e043133d22b5f