Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Sankarasubramaniam, Yogesh"'
Autor:
Sankarasubramaniam, Yogesh
Run-Length-Limited (RLL) channels are found in digital recording systems like the Hard Disk Drive (HDD), Compact Disc (CD), and Digital Versatile Disc (DVD). This thesis presents novel encoding algorithms for RLL channels based on a simple technique
Externí odkaz:
http://hdl.handle.net/1853/10483
The focus of this paper is on the public communication required for generating a maximal-rate secret key (SK) within the multiterminal source model of Csisz{\'a}r and Narayan. Building on the prior work of Tyagi for the two-terminal scenario, we deri
Externí odkaz:
http://arxiv.org/abs/1507.02874
In this paper, we address the problem of characterizing the instances of the multiterminal source model of Csisz\'ar and Narayan in which communication from all terminals is needed for establishing a secret key of maximum rate. We give an information
Externí odkaz:
http://arxiv.org/abs/1401.5037
In this paper, we propose a light-weight provably-secure authentication protocol called the NLHB protocol, which is a variant of the HB protocol. The HB protocol uses the complexity of decoding linear codes for security against passive attacks. In co
Externí odkaz:
http://arxiv.org/abs/1001.2140
In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorithm, called symbol sliding, is a generalized version of the bit flippin
Externí odkaz:
http://arxiv.org/abs/cs/0411006
Publikováno v:
In Information Processing and Management May 2014 50(3):443-461
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
2013 National Conference on Communications (NCC); 2013, p1-5, 5p
Publikováno v:
2012 National Conference on Communications (NCC); 1/ 1/2012, p1-5, 5p
Publikováno v:
2012 IEEE International Symposium on Information Theory Proceedings; 1/ 1/2012, p1787-1791, 5p