Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Badri N. Vellambi"'
Publikováno v:
Symmetry, Vol 14, Iss 3, p 599 (2022)
There are a total of 64 possible multiplication rules that can be defined starting with the generalized imaginary units first introduced by Hamilton. Of these sixty-four choices, only eight lead to non-commutative division algebras: two are associate
Externí odkaz:
https://doaj.org/article/b73e1658c71a4a5d823b89ee4f70d0aa
Publikováno v:
IEEE Journal on Selected Areas in Information Theory. 2:106-120
Establishing code equivalences between index coding and network coding provides important insights for code design. Previous works showed an equivalence relation between any index-coding instance and a network-coding instance, for which a code for on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a057f24801c382536de035def11705ae
https://doi.org/10.1109/jsait.2021.3054847
https://doi.org/10.1109/jsait.2021.3054847
Autor:
Lawrence Ong, Badri N. Vellambi
In the pliable variant of index coding, receivers are allowed to decode any new message not known a priori. Optimal code design for this variant involves identifying each receiver's choice of a new message that minimises the overall transmission rate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6a8c0aa769a136ee68dd4ff07cb7807
http://arxiv.org/abs/2205.02614
http://arxiv.org/abs/2205.02614
Publikováno v:
AAAI
General intelligence, the ability to solve arbitrary solvable problems, is supposed by many to be artificially constructible. Narrow intelligence, the ability to solve a given particularly difficult problem, has seen impressive recent development. No
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b79cfa5ad290583e73b656867263641d
https://doi.org/10.1609/aaai.v34i03.5628
https://doi.org/10.1609/aaai.v34i03.5628
Algorithmic Information Theory has inspired intractable constructions of general intelligence (AGI), and undiscovered tractable approximations are likely feasible. Reinforcement Learning (RL), the dominant paradigm by which an agent might learn to so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17bf8ed5e3cdac9980a67048f11509bd
Autor:
Badri N. Vellambi, Lawrence Ong
Publikováno v:
ISIT
An equivalence was shown between network coding and index coding. The equivalence allows for a network code for any given network-coding instance to be translated to an index code for a suitably constructed index-coding instance, and vice versa. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac54dcd9964d04c2036850d67cb33a13
https://doi.org/10.1109/isit44484.2020.9174175
https://doi.org/10.1109/isit44484.2020.9174175
Publikováno v:
ISIT
We characterise the optimal broadcast rate for a few classes of pliable-index-coding problems. This is achieved by devising new lower bounds that utilise the set of absent receivers to construct decoding chains with skipped messages. This work comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca8ff3662658fbbd4a80b031cdb6dc93
http://arxiv.org/abs/1909.11847
http://arxiv.org/abs/1909.11847
We study the problem of strong coordination of the actions of two nodes $X$ and $Y$ that communicate over a discrete memoryless channel (DMC) such that the actions follow a prescribed joint probability distribution. We propose two novel random coding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ae2d95813e84da7949590c4f8169ef3
http://arxiv.org/abs/1808.05475
http://arxiv.org/abs/1808.05475
Autor:
Marcus Hutter, Badri N. Vellambi
Publikováno v:
ISIT
This work investigates the convergence rate of learning the stationary distribution of finite-alphabet stationary ergodic sources using a binarized context-tree weighting approach. The binarized context-tree weighting $(\overline{\mathbf{C}\mathbf{T}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::501ce41f2fc7a691ccd345ebe8789d71
https://doi.org/10.1109/isit.2018.8437737
https://doi.org/10.1109/isit.2018.8437737
Publikováno v:
ISIT
A linear code equivalence between index coding and network coding was shown by El Rouayheb et al., which establishes that for any index-coding instance, there exists a network-coding instance for which any index code can be mapped to a suitable netwo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99e5ad1a79a51d192f840f6e01698060
https://doi.org/10.1109/isit.2018.8437816
https://doi.org/10.1109/isit.2018.8437816