Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Eldho K. Thomas"'
Publikováno v:
IEEE Transactions on Information Theory. 68:1545-1559
We propose a new model of asynchronous batch codes that allow for parallel recovery of information symbols from a coded database in an asynchronous manner, i.e. when queries arrive at random times and they take varying time to process. We show that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b5397dd6cfaf24131a78e8532b2e160
https://doi.org/10.1109/tit.2021.3131620
https://doi.org/10.1109/tit.2021.3131620
Autor:
Eldho K. Thomas
This thesis is dedicated to the study of information inequalities and quasi-uniform codes using group theory. Understanding the region of entropic vectors for dimension n ≥ 4 is an open problem in network information theory. It can be studied using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a5cb4f289a724dc75523a93e37066cb
https://doi.org/10.32657/10356/62207
https://doi.org/10.32657/10356/62207
Publikováno v:
Advances in Mathematics of Communications. 10:871-893
In this paper we use group theoretic tools to obtain random variables which violate linear rank inequalities, that is inequalities which always hold on ranks of subspaces. We consider ten of the 24 (non-Shannon type) generators of linear rank inequal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16cf74e11b645edab8b6f74bb398ec37
https://doi.org/10.3934/amc.2016047
https://doi.org/10.3934/amc.2016047
Publikováno v:
ITW
We propose a new model of asynchronous batch codes that allow for parallel recovery of information symbols from a coded database in an asynchronous manner, i.e., when different queries take different time to process. Then, we show that the graph-base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea0d49f9f125ab8c2c1aa64a090c44cf
https://doi.org/10.1109/itw.2018.8613518
https://doi.org/10.1109/itw.2018.8613518
Publikováno v:
IEEE Communications Letters, vol 21, iss 4
IEEE COMMUNICATIONS LETTERS, vol 21, iss 4
Thomas, EK; Tan, VYF; Vardy, A; & Motani, M. (2017). Polar Coding for the Binary Erasure Channel With Deletions. IEEE COMMUNICATIONS LETTERS, 21(4), 710-713. doi: 10.1109/LCOMM.2017.2650918. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/68p823s6
IEEE COMMUNICATIONS LETTERS, vol 21, iss 4
Thomas, EK; Tan, VYF; Vardy, A; & Motani, M. (2017). Polar Coding for the Binary Erasure Channel With Deletions. IEEE COMMUNICATIONS LETTERS, 21(4), 710-713. doi: 10.1109/LCOMM.2017.2650918. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/68p823s6
We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decodi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca57c0a95a8dac00ce6cfe9a8ed2b86b
http://arxiv.org/abs/1701.01938
http://arxiv.org/abs/1701.01938
Autor:
Vitaly Skachek, Eldho K. Thomas
Publikováno v:
Coding Theory and Applications ISBN: 9783319662770
ICMCTA
ICMCTA
Linear batch codes and codes for private information retrieval (PIR) with a query size t and a restricted size r of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of t or r by providing co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c0453f4e2d0bbd1eb99d35875854609
https://doi.org/10.1007/978-3-319-66278-7_24
https://doi.org/10.1007/978-3-319-66278-7_24
Autor:
Frederique Oggier, Eldho K. Thomas
We consider the design of quasi-uniform codes from dihedral 2-groups. Quasi-uniform codes have the distinctive feature of allowing codeword coefficients to live in different alphabets. We obtain a bound on the minimum distance of quasiuniform codes c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f4af58a08ae03d300302bf0d03fe712
http://hdl.handle.net/10220/24617
http://hdl.handle.net/10220/24617
Autor:
Eldho K. Thomas, Frederique Oggier
Publikováno v:
ISIT
We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian groups. Po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c111f0e01061e63322353528dccc828
http://arxiv.org/abs/1301.6328
http://arxiv.org/abs/1301.6328
Autor:
Frederique Oggier, Eldho K. Thomas
Publikováno v:
2012 International Conference on Signal Processing and Communications (SPCOM).
In this note, we study quasi-uniform distributions that are obtained from finite groups. We derive a few simple properties of entropic vectors obtained from Abelian groups, and consider the problem of determining when non-Abelian groups can provide r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12f6ec57467fc9d4af713dbc8d10f8b1
https://doi.org/10.1109/spcom.2012.6290020
https://doi.org/10.1109/spcom.2012.6290020
A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic vectors o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc1d6c16326455b9caa25f70f1d4e9b5