default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Navin Kashyap
@article{DBLP:journals/tit/HuangKV24,
author = {Yuwen Huang and
Navin Kashyap and
Pascal O. Vontobel},
title = {Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent
of a Non-Negative Matrix},
journal = {{IEEE} Trans. Inf. Theory},
volume = {70},
number = {7},
pages = {5289--5308},
year = {2024},
url = {https://doi.org/10.1109/TIT.2024.3374787},
doi = {10.1109/TIT.2024.3374787},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/HuangKV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/SudevanDAK24,
author = {Sowrabh Sudevan and
Sourin Das and
Thamadathil Aswanth and
Navin Kashyap},
title = {Sequentially Encodable Codeword Stabilized Codes},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2024
- Workshops, Athens, Greece, July 7, 2024},
pages = {1--6},
publisher = {{IEEE}},
year = {2024},
url = {https://doi.org/10.1109/ISIT-W61686.2024.10591769},
doi = {10.1109/ISIT-W61686.2024.10591769},
timestamp = {Thu, 15 Aug 2024 11:35:28 +0200},
biburl = {https://dblp.org/rec/conf/isit/SudevanDAK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncc/RameshwarJK24,
author = {V Arvind Rameshwar and
Shreyas Jain and
Navin Kashyap},
title = {Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller
Codes},
booktitle = {National Conference on Communications, {NCC} 2024, Chennai, India,
February 28 - March 2, 2024},
pages = {1--6},
publisher = {{IEEE}},
year = {2024},
url = {https://doi.org/10.1109/NCC60321.2024.10485899},
doi = {10.1109/NCC60321.2024.10485899},
timestamp = {Wed, 10 Apr 2024 20:58:43 +0200},
biburl = {https://dblp.org/rec/conf/ncc/RameshwarJK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-05893,
author = {Shreyas Jain and
V Arvind Rameshwar and
Navin Kashyap},
title = {Estimating the Weight Enumerators of Reed-Muller Codes via Sampling},
journal = {CoRR},
volume = {abs/2403.05893},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.05893},
doi = {10.48550/ARXIV.2403.05893},
eprinttype = {arXiv},
eprint = {2403.05893},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-05893.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-18469,
author = {Prachi Mishra and
Navin Kashyap},
title = {Error-Resilient Weakly Constrained Coding via Row-by-Row Coding},
journal = {CoRR},
volume = {abs/2404.18469},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.18469},
doi = {10.48550/ARXIV.2404.18469},
eprinttype = {arXiv},
eprint = {2404.18469},
timestamp = {Mon, 27 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-18469.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-05734,
author = {Daanish Mahajan and
Chirag Jain and
Navin Kashyap},
title = {On the Coverage Required for Diploid Genome Assembly},
journal = {CoRR},
volume = {abs/2405.05734},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.05734},
doi = {10.48550/ARXIV.2405.05734},
eprinttype = {arXiv},
eprint = {2405.05734},
timestamp = {Thu, 13 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-05734.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-06142,
author = {Sowrabh Sudevan and
Sourin Das and
Thamadathil Aswanth and
Navin Kashyap},
title = {Sequentially Encodable Codeword Stabilized Codes},
journal = {CoRR},
volume = {abs/2405.06142},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.06142},
doi = {10.48550/ARXIV.2405.06142},
eprinttype = {arXiv},
eprint = {2405.06142},
timestamp = {Mon, 24 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-06142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsait/RameshwarK23,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Estimating the Sizes of Binary Error-Correcting Constrained Codes},
journal = {{IEEE} J. Sel. Areas Inf. Theory},
volume = {4},
pages = {144--158},
year = {2023},
url = {https://doi.org/10.1109/JSAIT.2023.3279113},
doi = {10.1109/JSAIT.2023.3279113},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsait/RameshwarK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pe/KumarKY23,
author = {B. R. Vinay Kumar and
Navin Kashyap and
D. Yogeshwaran},
title = {An analysis of probabilistic forwarding of coded packets on random
geometric graphs},
journal = {Perform. Evaluation},
volume = {160},
pages = {102343},
year = {2023},
url = {https://doi.org/10.1016/j.peva.2023.102343},
doi = {10.1016/J.PEVA.2023.102343},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pe/KumarKY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/VippathallaK23,
author = {Praneeth Kumar Vippathalla and
Navin Kashyap},
title = {The Secure Storage Capacity of a {DNA} Wiretap Channel Model},
journal = {{IEEE} Trans. Inf. Theory},
volume = {69},
number = {9},
pages = {5550--5569},
year = {2023},
url = {https://doi.org/10.1109/TIT.2023.3274664},
doi = {10.1109/TIT.2023.3274664},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/VippathallaK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/RameshwarK23,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Coding Schemes Based on Reed-Muller Codes for (d, {\(\infty\)})-RLL
Input-Constrained Channels},
journal = {{IEEE} Trans. Inf. Theory},
volume = {69},
number = {11},
pages = {7003--7024},
year = {2023},
url = {https://doi.org/10.1109/TIT.2023.3296207},
doi = {10.1109/TIT.2023.3296207},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/RameshwarK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/VippathallaCKZ23,
author = {Praneeth Kumar Vippathalla and
Chung Chan and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Secret Key Agreement via Secure Omniscience},
journal = {{IEEE} Trans. Inf. Theory},
volume = {69},
number = {12},
pages = {8029--8053},
year = {2023},
url = {https://doi.org/10.1109/TIT.2023.3327151},
doi = {10.1109/TIT.2023.3327151},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/VippathallaCKZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RameshwarK23,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {A Version of Delsarte's Linear Program for Constrained Systems},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2023,
Taipei, Taiwan, June 25-30, 2023},
pages = {30--35},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ISIT54713.2023.10206570},
doi = {10.1109/ISIT54713.2023.10206570},
timestamp = {Mon, 28 Aug 2023 17:20:14 +0200},
biburl = {https://dblp.org/rec/conf/isit/RameshwarK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RameshwarK23a,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Counting Constrained Codewords in Binary Linear Codes via Fourier
Expansions},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2023,
Taipei, Taiwan, June 25-30, 2023},
pages = {2667--2672},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ISIT54713.2023.10206631},
doi = {10.1109/ISIT54713.2023.10206631},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/RameshwarK23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-05098,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Estimating the Sizes of Binary Error-Correcting Constrained Codes},
journal = {CoRR},
volume = {abs/2301.05098},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.05098},
doi = {10.48550/ARXIV.2301.05098},
eprinttype = {arXiv},
eprint = {2301.05098},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-05098.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-08907,
author = {V Arvind Rameshwar and
Shreyas Jain and
Navin Kashyap},
title = {Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller
Codes},
journal = {CoRR},
volume = {abs/2309.08907},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.08907},
doi = {10.48550/ARXIV.2309.08907},
eprinttype = {arXiv},
eprint = {2309.08907},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-08907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/SidanaK22,
author = {Tania Sidana and
Navin Kashyap},
title = {Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius
Rings},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2022,
Espoo, Finland, June 26 - July 1, 2022},
pages = {1064--1069},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ISIT50566.2022.9834381},
doi = {10.1109/ISIT50566.2022.9834381},
timestamp = {Mon, 08 Aug 2022 16:44:13 +0200},
biburl = {https://dblp.org/rec/conf/isit/SidanaK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RameshwarK22,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {On the Performance of Reed-Muller Codes Over (d, {\(\infty\)})-RLL
Input-Constrained {BMS} Channels},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2022,
Espoo, Finland, June 26 - July 1, 2022},
pages = {1755--1760},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ISIT50566.2022.9834876},
doi = {10.1109/ISIT50566.2022.9834876},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/RameshwarK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/VippathallaK22,
author = {Praneeth Kumar Vippathalla and
Navin Kashyap},
title = {The Secure Storage Capacity of a {DNA} Wiretap Channel Model},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2022,
Espoo, Finland, June 26 - July 1, 2022},
pages = {1785--1790},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ISIT50566.2022.9834344},
doi = {10.1109/ISIT50566.2022.9834344},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/VippathallaK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/RameshwarK22,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding
Schemes for Input-Constrained {BMS} Channels},
booktitle = {{IEEE} Information Theory Workshop, {ITW} 2022, Mumbai, India, November
1-9, 2022},
pages = {624--629},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ITW54588.2022.9965911},
doi = {10.1109/ITW54588.2022.9965911},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/itw/RameshwarK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/VippathallaCKZ22,
author = {Praneeth Kumar Vippathalla and
Chung Chan and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Positivity of Secret Key Capacity for Hypergraphical Sources with
a Linear Wiretapper},
booktitle = {{IEEE} Information Theory Workshop, {ITW} 2022, Mumbai, India, November
1-9, 2022},
pages = {726--731},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ITW54588.2022.9965830},
doi = {10.1109/ITW54588.2022.9965830},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/itw/VippathallaCKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spcom/RameshwarK22,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {A Feedback Capacity-Achieving Coding Scheme for the (d, {\(\infty\)})-RLL
Input-Constrained Binary Erasure Channel},
booktitle = {{IEEE} International Conference on Signal Processing and Communications,
{SPCOM} 2022, Bangalore, India, July 11-15, 2022},
pages = {1--5},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/SPCOM55316.2022.9840852},
doi = {10.1109/SPCOM55316.2022.9840852},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spcom/RameshwarK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-02035,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {On the Performance of Reed-Muller Codes Over (d, {\(\infty\)})-RLL
Input-Constrained {BMS} Channels},
journal = {CoRR},
volume = {abs/2201.02035},
year = {2022},
url = {https://arxiv.org/abs/2201.02035},
eprinttype = {arXiv},
eprint = {2201.02035},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-02035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05995,
author = {Praneeth Kumar Vippathalla and
Navin Kashyap},
title = {The Secure Storage Capacity of a {DNA} Wiretap Channel Model},
journal = {CoRR},
volume = {abs/2201.05995},
year = {2022},
url = {https://arxiv.org/abs/2201.05995},
eprinttype = {arXiv},
eprint = {2201.05995},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-00248,
author = {Tania Sidana and
Navin Kashyap},
title = {Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius
Rings},
journal = {CoRR},
volume = {abs/2202.00248},
year = {2022},
url = {https://arxiv.org/abs/2202.00248},
eprinttype = {arXiv},
eprint = {2202.00248},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-00248.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-06780,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {A Feedback Capacity-Achieving Coding Scheme for the (d, {\(\infty\)})-RLL
Input-Constrained Binary Erasure Channel},
journal = {CoRR},
volume = {abs/2204.06780},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.06780},
doi = {10.48550/ARXIV.2204.06780},
eprinttype = {arXiv},
eprint = {2204.06780},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-06780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-04153,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding
Schemes for Input-Constrained {BMS} Channels},
journal = {CoRR},
volume = {abs/2205.04153},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.04153},
doi = {10.48550/ARXIV.2205.04153},
eprinttype = {arXiv},
eprint = {2205.04153},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-04153.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-05513,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Coding Schemes Based on Reed-Muller Codes for (d, {\(\infty\)})-RLL
Input-Constrained Channels},
journal = {CoRR},
volume = {abs/2211.05513},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.05513},
doi = {10.48550/ARXIV.2211.05513},
eprinttype = {arXiv},
eprint = {2211.05513},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-05513.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tgcn/RahmanVPAVK21,
author = {Haseen Rahman and
Ankith Vinayachandran and
Sibi Raj B. Pillai and
Kumar Appaiah and
Rahul Vaze and
Navin Kashyap},
title = {Deadline Constrained Packet Scheduling in the Presence of an Energy
Harvesting Jammer},
journal = {{IEEE} Trans. Green Commun. Netw.},
volume = {5},
number = {1},
pages = {278--290},
year = {2021},
url = {https://doi.org/10.1109/TGCN.2020.3017531},
doi = {10.1109/TGCN.2020.3017531},
timestamp = {Mon, 12 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tgcn/RahmanVPAVK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/HuleihelSPKS21,
author = {Bashar Huleihel and
Oron Sabag and
Haim H. Permuter and
Navin Kashyap and
Shlomo Shamai Shitz},
title = {Computable Upper Bounds on the Capacity of Finite-State Channels},
journal = {{IEEE} Trans. Inf. Theory},
volume = {67},
number = {9},
pages = {5674--5692},
year = {2021},
url = {https://doi.org/10.1109/TIT.2021.3091691},
doi = {10.1109/TIT.2021.3091691},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/HuleihelSPKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/KumarK21,
author = {B. R. Vinay Kumar and
Navin Kashyap},
title = {Probabilistic Forwarding of Coded Packets on Networks},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {29},
number = {1},
pages = {234--247},
year = {2021},
url = {https://doi.org/10.1109/TNET.2020.3031467},
doi = {10.1109/TNET.2020.3031467},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/KumarK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RameshwarK21,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Bounds on the Feedback Capacity of the ({\textdollar}d, {\textbackslash}infty{\textdollar})-RLL
Input-Constrained Binary Erasure Channel},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
Melbourne, Australia, July 12-20, 2021},
pages = {290--295},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ISIT45174.2021.9518138},
doi = {10.1109/ISIT45174.2021.9518138},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/RameshwarK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/VippathallaCKZ21,
author = {Praneeth Kumar Vippathalla and
Chung Chan and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Secret Key Agreement and Secure Omniscience of Tree-PIN Source with
Linear Wiretapper},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
Melbourne, Australia, July 12-20, 2021},
pages = {1624--1629},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ISIT45174.2021.9518075},
doi = {10.1109/ISIT45174.2021.9518075},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/VippathallaCKZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GeorgeK21,
author = {Anand Jerry George and
Navin Kashyap},
title = {An {MCMC} Method to Sample from Lattice Distributions},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
Melbourne, Australia, July 12-20, 2021},
pages = {3074--3079},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ISIT45174.2021.9517919},
doi = {10.1109/ISIT45174.2021.9517919},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/GeorgeK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wiopt/KumarKY21,
author = {B. R. Vinay Kumar and
Navin Kashyap and
D. Yogeshwaran},
editor = {Javad Ghaderi and
Elif Uysal and
Guoliang Xue},
title = {An Analysis of Probabilistic Forwarding of Coded Packets on Random
Geometric Graphs},
booktitle = {19th International Symposium on Modeling and Optimization in Mobile,
Ad hoc, and Wireless Networks, WiOpt 2021, Virtual Conference, October
18-21, 2021},
pages = {9--16},
publisher = {{IFIP}},
year = {2021},
url = {https://dl.ifip.org/db/conf/wiopt/wiopt2021/WiOpt\_2021\_paper\_49.pdf},
doi = {10.23919/WIOPT52861.2021.9589218},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wiopt/KumarKY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-06453,
author = {Anand Jerry George and
Navin Kashyap},
title = {An {MCMC} Method to Sample from Lattice Distributions},
journal = {CoRR},
volume = {abs/2101.06453},
year = {2021},
url = {https://arxiv.org/abs/2101.06453},
eprinttype = {arXiv},
eprint = {2101.06453},
timestamp = {Tue, 26 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-06453.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-08638,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Bounds on the Feedback Capacity of the (d, {\(\infty\)})-RLL Input-Constrained
Binary Erasure Channel},
journal = {CoRR},
volume = {abs/2101.08638},
year = {2021},
url = {https://arxiv.org/abs/2101.08638},
eprinttype = {arXiv},
eprint = {2101.08638},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-08638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-01771,
author = {Praneeth Kumar Vippathalla and
Chung Chan and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Secret Key Agreement and Secure Omniscience of Tree-PIN Source with
Linear Wiretapper},
journal = {CoRR},
volume = {abs/2102.01771},
year = {2021},
url = {https://arxiv.org/abs/2102.01771},
eprinttype = {arXiv},
eprint = {2102.01771},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-01771.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08779,
author = {B. R. Vinay Kumar and
Navin Kashyap and
D. Yogeshwaran},
title = {An Analysis of Probabilistic Forwarding of Coded Packets on Random
Geometric Graphs},
journal = {CoRR},
volume = {abs/2105.08779},
year = {2021},
url = {https://arxiv.org/abs/2105.08779},
eprinttype = {arXiv},
eprint = {2105.08779},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-00394,
author = {Praneeth Kumar Vippathalla and
Chung Chan and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Wiretap Secret Key Agreement Via Secure Omniscience},
journal = {CoRR},
volume = {abs/2112.00394},
year = {2021},
url = {https://arxiv.org/abs/2112.00394},
eprinttype = {arXiv},
eprint = {2112.00394},
timestamp = {Tue, 07 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-00394.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChanKVZ20,
author = {Chung Chan and
Navin Kashyap and
Praneeth Kumar Vippathalla and
Qiaoqiao Zhou},
title = {Secure Information Exchange for Omniscience},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2020,
Los Angeles, CA, USA, June 21-26, 2020},
pages = {966--971},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ISIT44484.2020.9174231},
doi = {10.1109/ISIT44484.2020.9174231},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/ChanKVZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RameshwarK20,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Computable Lower Bounds for Capacities of Input-Driven Finite-State
Channels},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2020,
Los Angeles, CA, USA, June 21-26, 2020},
pages = {2002--2007},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ISIT44484.2020.9174165},
doi = {10.1109/ISIT44484.2020.9174165},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/RameshwarK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isita/RameshwarRK20,
author = {V Arvind Rameshwar and
Aryabhatt M. Reghu and
Navin Kashyap},
title = {On the Capacity of the Flash Memory Channel with Feedback},
booktitle = {International Symposium on Information Theory and Its Applications,
{ISITA} 2020, Kapolei, HI, USA, October 24-27, 2020},
pages = {11--15},
publisher = {{IEEE}},
year = {2020},
url = {https://ieeexplore.ieee.org/document/9366100},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isita/RameshwarRK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-03423,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Computable Lower Bounds for Capacities of Input-Driven Finite-State
Channels},
journal = {CoRR},
volume = {abs/2001.03423},
year = {2020},
url = {https://arxiv.org/abs/2001.03423},
eprinttype = {arXiv},
eprint = {2001.03423},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-03423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04438,
author = {B. R. Vinay Kumar and
Navin Kashyap},
title = {Probabilistic Forwarding of Coded Packets on Networks},
journal = {CoRR},
volume = {abs/2002.04438},
year = {2020},
url = {https://arxiv.org/abs/2002.04438},
eprinttype = {arXiv},
eprint = {2002.04438},
timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-04438.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-01580,
author = {Navin Kashyap and
Manjunath Krishnapur},
title = {How many modes can a constrained Gaussian mixture have?},
journal = {CoRR},
volume = {abs/2005.01580},
year = {2020},
url = {https://arxiv.org/abs/2005.01580},
eprinttype = {arXiv},
eprint = {2005.01580},
timestamp = {Sun, 10 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-01580.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChanMKZ19,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Upper Bounds via Lamination on the Constrained Secrecy Capacity of
Hypergraphical Sources},
journal = {{IEEE} Trans. Inf. Theory},
volume = {65},
number = {8},
pages = {5080--5093},
year = {2019},
url = {https://doi.org/10.1109/TIT.2019.2897129},
doi = {10.1109/TIT.2019.2897129},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ChanMKZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChanKVZ19,
author = {Chung Chan and
Navin Kashyap and
Praneeth Kumar Vippathalla and
Qiaoqiao Zhou},
title = {One-Shot Perfect Secret Key Agreement for Finite Linear Sources},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {947--951},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849668},
doi = {10.1109/ISIT.2019.8849668},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/ChanKVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KashyapRS19,
author = {Navin Kashyap and
Ron M. Roth and
Paul H. Siegel},
title = {The Capacity of Count-Constrained ICI-Free Systems},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {1592--1596},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849473},
doi = {10.1109/ISIT.2019.8849473},
timestamp = {Tue, 01 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/KashyapRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/HuleihelSPKS19,
author = {Bashar Huleihel and
Oron Sabag and
Haim H. Permuter and
Navin Kashyap and
Shlomo Shamai Shitz},
title = {Computable Upper Bounds for Unifilar Finite-State Channels},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {1892--1896},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849776},
doi = {10.1109/ISIT.2019.8849776},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/HuleihelSPKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KumarK19,
author = {B. R. Vinay Kumar and
Navin Kashyap},
title = {Probabilistic Forwarding of Coded Packets on Networks},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {1952--1956},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849508},
doi = {10.1109/ISIT.2019.8849508},
timestamp = {Tue, 01 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/KumarK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncc/RameshwarK19,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for
all Feasible (n, k, d) Parameter Values},
booktitle = {National Conference on Communications, {NCC} 2019, Bangalore, India,
February 20-23, 2019},
pages = {1--6},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/NCC.2019.8732243},
doi = {10.1109/NCC.2019.8732243},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ncc/RameshwarK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-02033,
author = {B. R. Vinay Kumar and
Roshan Antony and
Navin Kashyap},
title = {The Effect of Introducing Redundancy in a Probabilistic Forwarding
Protocol},
journal = {CoRR},
volume = {abs/1901.02033},
year = {2019},
url = {http://arxiv.org/abs/1901.02033},
eprinttype = {arXiv},
eprint = {1901.02033},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-02033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03261,
author = {Navin Kashyap and
Ron M. Roth and
Paul H. Siegel},
title = {The Capacity of Count-Constrained ICI-Free Systems},
journal = {CoRR},
volume = {abs/1901.03261},
year = {2019},
url = {http://arxiv.org/abs/1901.03261},
eprinttype = {arXiv},
eprint = {1901.03261},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-03261.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-05817,
author = {Chung Chan and
Navin Kashyap and
Praneeth Kumar Vippathalla and
Qiaoqiao Zhou},
title = {One-Shot Perfect Secret Key Agreement for Finite Linear Sources},
journal = {CoRR},
volume = {abs/1901.05817},
year = {2019},
url = {http://arxiv.org/abs/1901.05817},
eprinttype = {arXiv},
eprint = {1901.05817},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-05817.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-07498,
author = {B. R. Vinay Kumar and
Navin Kashyap},
title = {Probabilistic Forwarding of Coded Packets on Networks},
journal = {CoRR},
volume = {abs/1901.07498},
year = {2019},
url = {http://arxiv.org/abs/1901.07498},
eprinttype = {arXiv},
eprint = {1901.07498},
timestamp = {Sat, 02 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-07498.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-09865,
author = {V Arvind Rameshwar and
Navin Kashyap},
title = {Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for
all Feasible {\textdollar}(n, k, d){\textdollar} Parameter Values},
journal = {CoRR},
volume = {abs/1902.09865},
year = {2019},
url = {http://arxiv.org/abs/1902.09865},
eprinttype = {arXiv},
eprint = {1902.09865},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-09865.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-00721,
author = {Pranab Basu and
Navin Kashyap},
title = {The Lattice Structure of Linear Subspace Codes},
journal = {CoRR},
volume = {abs/1911.00721},
year = {2019},
url = {http://arxiv.org/abs/1911.00721},
eprinttype = {arXiv},
eprint = {1911.00721},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-00721.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-02113,
author = {Bashar Huleihel and
Oron Sabag and
Haim H. Permuter and
Navin Kashyap and
Shlomo Shamai},
title = {Computable Upper Bounds on the Capacity of Finite-State Channels},
journal = {CoRR},
volume = {abs/1911.02113},
year = {2019},
url = {http://arxiv.org/abs/1911.02113},
eprinttype = {arXiv},
eprint = {1911.02113},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-02113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChanMKZ18,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {On the Optimality of Secret Key Agreement via Omniscience},
journal = {{IEEE} Trans. Inf. Theory},
volume = {64},
number = {4},
pages = {2371--2389},
year = {2018},
url = {https://doi.org/10.1109/TIT.2018.2802546},
doi = {10.1109/TIT.2018.2802546},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/ChanMKZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/SabagPK18,
author = {Oron Sabag and
Haim H. Permuter and
Navin Kashyap},
title = {Feedback Capacity and Coding for the {BIBO} Channel With a No-Repeated-Ones
Input Constraint},
journal = {{IEEE} Trans. Inf. Theory},
volume = {64},
number = {7},
pages = {4940--4961},
year = {2018},
url = {https://doi.org/10.1109/TIT.2018.2809554},
doi = {10.1109/TIT.2018.2809554},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/SabagPK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChanMKZ18,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Multiterminal Secret Key Agreement at Asymptotically Zero Discussion
Rate},
booktitle = {2018 {IEEE} International Symposium on Information Theory, {ISIT}
2018, Vail, CO, USA, June 17-22, 2018},
pages = {2654--2658},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ISIT.2018.8437913},
doi = {10.1109/ISIT.2018.8437913},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/ChanMKZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isita/ManickamK18,
author = {Shivkumar K. Manickam and
Navin Kashyap},
title = {On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited
Constraint},
booktitle = {International Symposium on Information Theory and Its Applications,
{ISITA} 2018, Singapore, October 28-31, 2018},
pages = {648--652},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.23919/ISITA.2018.8664350},
doi = {10.23919/ISITA.2018.8664350},
timestamp = {Wed, 11 Aug 2021 11:51:25 +0200},
biburl = {https://dblp.org/rec/conf/isita/ManickamK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-04955,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Multiterminal Secret Key Agreement at Asymptotically Zero Discussion
Rate},
journal = {CoRR},
volume = {abs/1802.04955},
year = {2018},
url = {http://arxiv.org/abs/1802.04955},
eprinttype = {arXiv},
eprint = {1802.04955},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-04955.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-01115,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Upper Bounds via Lamination on the Constrained Secrecy Capacity of
Hypergraphical Sources},
journal = {CoRR},
volume = {abs/1805.01115},
year = {2018},
url = {http://arxiv.org/abs/1805.01115},
eprinttype = {arXiv},
eprint = {1805.01115},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-01115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/poit/VatedkaK17,
author = {Shashank Vatedka and
Navin Kashyap},
title = {Some "goodness" properties of {LDA} lattices},
journal = {Probl. Inf. Transm.},
volume = {53},
number = {1},
pages = {1--29},
year = {2017},
url = {https://doi.org/10.1134/S003294601701001X},
doi = {10.1134/S003294601701001X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/poit/VatedkaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChanFKK17,
author = {Chun Lam Chan and
Winston Fernandes and
Navin Kashyap and
Manjunath Krishnapur},
title = {Phase Transitions for the Uniform Distribution in the Pattern Maximum
Likelihood Problem and its Bethe Approximation},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {1},
pages = {597--631},
year = {2017},
url = {https://doi.org/10.1137/15M1028819},
doi = {10.1137/15M1028819},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChanFKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/SabagPK17,
author = {Oron Sabag and
Haim H. Permuter and
Navin Kashyap},
title = {An optimal coding scheme for the {BIBO} channel with a no-repeated-ones
input constraint},
booktitle = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
2017, Aachen, Germany, June 25-30, 2017},
pages = {216--220},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ISIT.2017.8006521},
doi = {10.1109/ISIT.2017.8006521},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/SabagPK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChanMKZ17,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Secret key agreement under discussion rate constraints},
booktitle = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
2017, Aachen, Germany, June 25-30, 2017},
pages = {1519--1523},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ISIT.2017.8006783},
doi = {10.1109/ISIT.2017.8006783},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/ChanMKZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncc/ShivkumarK17,
author = {K. Manickam Shivkumar and
Navin Kashyap},
title = {A maximization problem related to Huffman codes},
booktitle = {Twenty-third National Conference on Communications, {NCC} 2017, Chennai,
India, March 2-4, 2017},
pages = {1--6},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/NCC.2017.8077093},
doi = {10.1109/NCC.2017.8077093},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/ncc/ShivkumarK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChanMKZ17,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Secret Key Agreement under Discussion Rate Constraints},
journal = {CoRR},
volume = {abs/1701.05008},
year = {2017},
url = {http://arxiv.org/abs/1701.05008},
eprinttype = {arXiv},
eprint = {1701.05008},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChanMKZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SabagPK17,
author = {Oron Sabag and
Haim H. Permuter and
Navin Kashyap},
title = {Feedback capacity and coding for the {BIBO} channel with a no-repeated-ones
input constraint},
journal = {CoRR},
volume = {abs/1701.06174},
year = {2017},
url = {http://arxiv.org/abs/1701.06174},
eprinttype = {arXiv},
eprint = {1701.06174},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SabagPK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChanMKZ17a,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {On the Optimality of Secret Key Agreement via Omniscience},
journal = {CoRR},
volume = {abs/1702.07429},
year = {2017},
url = {http://arxiv.org/abs/1702.07429},
eprinttype = {arXiv},
eprint = {1702.07429},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChanMKZ17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/DasK16,
author = {N. V. Abhinav Das and
Navin Kashyap},
title = {{MCMC} Methods for Drawing Random Samples From the Discrete-Grains
Model of a Magnetic Medium},
journal = {{IEEE} J. Sel. Areas Commun.},
volume = {34},
number = {9},
pages = {2430--2438},
year = {2016},
url = {https://doi.org/10.1109/JSAC.2016.2603619},
doi = {10.1109/JSAC.2016.2603619},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsac/DasK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/SabagPK16,
author = {Oron Sabag and
Haim H. Permuter and
Navin Kashyap},
title = {The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones
Input Constraint},
journal = {{IEEE} Trans. Inf. Theory},
volume = {62},
number = {1},
pages = {8--22},
year = {2016},
url = {https://doi.org/10.1109/TIT.2015.2495239},
doi = {10.1109/TIT.2015.2495239},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/SabagPK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MukherjeeKS16,
author = {Manuj Mukherjee and
Navin Kashyap and
Yogesh Sankarasubramaniam},
title = {On the Public Communication Needed to Achieve {SK} Capacity in the
Multiterminal Source Model},
journal = {{IEEE} Trans. Inf. Theory},
volume = {62},
number = {7},
pages = {3811--3830},
year = {2016},
url = {https://doi.org/10.1109/TIT.2016.2533546},
doi = {10.1109/TIT.2016.2533546},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/MukherjeeKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/VatedkaK16,
author = {Shashank Vatedka and
Navin Kashyap},
title = {A lattice coding scheme for secret key generation from Gaussian Markov
tree sources},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
Barcelona, Spain, July 10-15, 2016},
pages = {515--519},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ISIT.2016.7541352},
doi = {10.1109/ISIT.2016.7541352},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/VatedkaK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MukherjeeCKZ16,
author = {Manuj Mukherjee and
Chung Chan and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Bounds on the communication rate needed to achieve {SK} capacity in
the hypergraphical source model},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
Barcelona, Spain, July 10-15, 2016},
pages = {2504--2508},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ISIT.2016.7541750},
doi = {10.1109/ISIT.2016.7541750},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/MukherjeeCKZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/ChanMKZ16,
author = {Chung Chan and
Manuj Mukherjee and
Navin Kashyap and
Qiaoqiao Zhou},
title = {When is omniscience a rate-optimal strategy for achieving secret key
capacity?},
booktitle = {2016 {IEEE} Information Theory Workshop, {ITW} 2016, Cambridge, United
Kingdom, September 11-14, 2016},
pages = {354--358},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ITW.2016.7606855},
doi = {10.1109/ITW.2016.7606855},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itw/ChanMKZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MukherjeeCKZ16,
author = {Manuj Mukherjee and
Chung Chan and
Navin Kashyap and
Qiaoqiao Zhou},
title = {Bounds on the Communication Rate Needed to Achieve {SK} Capacity in
the Hypergraphical Source Model},
journal = {CoRR},
volume = {abs/1601.05377},
year = {2016},
url = {http://arxiv.org/abs/1601.05377},
eprinttype = {arXiv},
eprint = {1601.05377},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MukherjeeCKZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VatedkaK16,
author = {Shashank Vatedka and
Navin Kashyap},
title = {A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov
Tree Sources},
journal = {CoRR},
volume = {abs/1601.05868},
year = {2016},
url = {http://arxiv.org/abs/1601.05868},
eprinttype = {arXiv},
eprint = {1601.05868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/VatedkaK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VatedkaK16a,
author = {Shashank Vatedka and
Navin Kashyap},
title = {A Capacity-Achieving Coding Scheme for the {AWGN} Channel with Polynomial
Encoding and Decoding Complexity},
journal = {CoRR},
volume = {abs/1603.08236},
year = {2016},
url = {http://arxiv.org/abs/1603.08236},
eprinttype = {arXiv},
eprint = {1603.08236},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/VatedkaK16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/VatedkaKT15,
author = {Shashank Vatedka and
Navin Kashyap and
Andrew Thangaraj},
title = {Secure Compute-and-Forward in a Bidirectional Relay},
journal = {{IEEE} Trans. Inf. Theory},
volume = {61},
number = {5},
pages = {2531--2556},
year = {2015},
url = {https://doi.org/10.1109/TIT.2015.2412114},
doi = {10.1109/TIT.2015.2412114},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/VatedkaKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/SabagPK15,
author = {Oron Sabag and
Haim H. Permuter and
Navin Kashyap},
title = {The feedback capacity of the binary symmetric channel with a no-consecutive-ones
input constraint},
booktitle = {53rd Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2015, Allerton Park {\&} Retreat Center, Monticello,
IL, USA, September 29 - October 2, 2015},
pages = {160--164},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ALLERTON.2015.7446999},
doi = {10.1109/ALLERTON.2015.7446999},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/allerton/SabagPK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MukherjeeK15,
author = {Manuj Mukherjee and
Navin Kashyap},
title = {The communication complexity of achieving {SK} capacity in a class
of {PIN} models},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2015,
Hong Kong, China, June 14-19, 2015},
pages = {296--300},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ISIT.2015.7282464},
doi = {10.1109/ISIT.2015.7282464},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/MukherjeeK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChanSJKV15,
author = {Chun Lam Chan and
Mahdi Jafari Siavoshani and
Sidharth Jaggi and
Navin Kashyap and
Pascal O. Vontobel},
title = {Generalized belief propagation for estimating the partition function
of the 2D Ising model},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2015,
Hong Kong, China, June 14-19, 2015},
pages = {2261--2265},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ISIT.2015.7282858},
doi = {10.1109/ISIT.2015.7282858},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/ChanSJKV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/SabagPK15,
author = {Oron Sabag and
Haim H. Permuter and
Navin Kashyap},
title = {Capacity of the (1, {\(\infty\)})-RLL input-constrained erasure channel
with feedback},
booktitle = {2015 {IEEE} Information Theory Workshop, {ITW} 2015, Jerusalem, Israel,
April 26 - May 1, 2015},
pages = {1--5},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ITW.2015.7133107},
doi = {10.1109/ITW.2015.7133107},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/itw/SabagPK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/VatedkaK15,
author = {Shashank Vatedka and
Navin Kashyap},
title = {Some "goodness" properties of {LDA} lattices},
booktitle = {2015 {IEEE} Information Theory Workshop, {ITW} 2015, Jerusalem, Israel,
April 26 - May 1, 2015},
pages = {1--5},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ITW.2015.7133102},
doi = {10.1109/ITW.2015.7133102},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itw/VatedkaK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/VatedkaK15a,
author = {Shashank Vatedka and
Navin Kashyap},
title = {Nested lattice codes for secure bidirectional relaying with asymmetric
channel gains},
booktitle = {2015 {IEEE} Information Theory Workshop, {ITW} 2015, Jerusalem, Israel,
April 26 - May 1, 2015},
pages = {1--5},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ITW.2015.7133151},
doi = {10.1109/ITW.2015.7133151},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itw/VatedkaK15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncc/BasuK15,
author = {Pranab Basu and
Navin Kashyap},
title = {On linear subspace codes closed under intersection},
booktitle = {Twenty First National Conference on Communications, {NCC} 2015, Mumbai,
India, February 27 - March 1, 2015},
pages = {1--6},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/NCC.2015.7084870},
doi = {10.1109/NCC.2015.7084870},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/ncc/BasuK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SabagPK15,
author = {Oron Sabag and
Haim H. Permuter and
Navin Kashyap},
title = {The Feedback Capacity of the (1, {\(\infty\)})-RLL Input-Constrained
Erasure Channel},
journal = {CoRR},
volume = {abs/1503.03359},
year = {2015},
url = {http://arxiv.org/abs/1503.03359},
eprinttype = {arXiv},
eprint = {1503.03359},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SabagPK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MukherjeeK15,
author = {Manuj Mukherjee and
Navin Kashyap},
title = {The communication complexity of achieving {SK} capacity in a class
of {PIN} models},
journal = {CoRR},
volume = {abs/1504.00629},
year = {2015},
url = {http://arxiv.org/abs/1504.00629},
eprinttype = {arXiv},
eprint = {1504.00629},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MukherjeeK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChanFKK15,
author = {Chun Lam Chan and
Winston Fernandes and
Navin Kashyap and
Manjunath Krishnapur},
title = {Phase Transitions for the Uniform Distribution in the {PML} Problem
and its Bethe Approximation},
journal = {CoRR},
volume = {abs/1506.00753},
year = {2015},
url = {http://arxiv.org/abs/1506.00753},
eprinttype = {arXiv},
eprint = {1506.00753},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChanFKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VatedkaK15,
author = {Shashank Vatedka and
Navin Kashyap},
title = {Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric
Channel Gains},
journal = {CoRR},
volume = {abs/1506.02152},
year = {2015},
url = {http://arxiv.org/abs/1506.02152},
eprinttype = {arXiv},
eprint = {1506.02152},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/VatedkaK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MukherjeeKS15,
author = {Manuj Mukherjee and
Navin Kashyap and
Yogesh Sankarasubramaniam},
title = {On the Public Communication Needed to Achieve {SK} Capacity in the
Multiterminal Source Model},
journal = {CoRR},
volume = {abs/1507.02874},
year = {2015},
url = {http://arxiv.org/abs/1507.02874},
eprinttype = {arXiv},
eprint = {1507.02874},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MukherjeeKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapZ14,
author = {Navin Kashyap and
Gilles Z{\'{e}}mor},
title = {Upper Bounds on the Size of Grain-Correcting Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {60},
number = {8},
pages = {4699--4709},
year = {2014},
url = {https://doi.org/10.1109/TIT.2014.2329008},
doi = {10.1109/TIT.2014.2329008},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MukherjeeK14,
author = {Manuj Mukherjee and
Navin Kashyap},
title = {On the communication complexity of secret key generation in the multiterminal
source model},
booktitle = {2014 {IEEE} International Symposium on Information Theory, Honolulu,
HI, USA, June 29 - July 4, 2014},
pages = {1151--1155},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ISIT.2014.6875013},
doi = {10.1109/ISIT.2014.6875013},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/MukherjeeK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MukherjeeKS14,
author = {Manuj Mukherjee and
Navin Kashyap and
Yogesh Sankarasubramaniam},
title = {Achieving {SK} capacity in the source model: When must all terminals
talk?},
booktitle = {2014 {IEEE} International Symposium on Information Theory, Honolulu,
HI, USA, June 29 - July 4, 2014},
pages = {1156--1160},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ISIT.2014.6875014},
doi = {10.1109/ISIT.2014.6875014},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/MukherjeeKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MukherjeeK14,
author = {Manuj Mukherjee and
Navin Kashyap},
title = {On the Communication Complexity of Secret Key Generation in the Multiterminal
Source Model},
journal = {CoRR},
volume = {abs/1401.1117},
year = {2014},
url = {http://arxiv.org/abs/1401.1117},
eprinttype = {arXiv},
eprint = {1401.1117},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MukherjeeK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MukherjeeKS14,
author = {Manuj Mukherjee and
Navin Kashyap and
Yogesh Sankarasubramaniam},
title = {Achieving {SK} Capacity in the Source Model: When Must All Terminals
Talk?},
journal = {CoRR},
volume = {abs/1401.5037},
year = {2014},
url = {http://arxiv.org/abs/1401.5037},
eprinttype = {arXiv},
eprint = {1401.5037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MukherjeeKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VatedkaK14,
author = {Shashank Vatedka and
Navin Kashyap},
title = {Some "Goodness" Properties of {LDA} Lattices},
journal = {CoRR},
volume = {abs/1410.7619},
year = {2014},
url = {http://arxiv.org/abs/1410.7619},
eprinttype = {arXiv},
eprint = {1410.7619},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/VatedkaK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/ManadaK13,
author = {Akiko Manada and
Navin Kashyap},
title = {On the Zeta Function of a Periodic-Finite-Type Shift},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {96-A},
number = {6},
pages = {1024--1031},
year = {2013},
url = {https://doi.org/10.1587/transfun.E96.A.1024},
doi = {10.1587/TRANSFUN.E96.A.1024},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/ManadaK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KashyaptZ13,
author = {Navin Kashyap and
Gilles Z{\'{e}}mor},
title = {Upper bounds on the size of grain-correcting codes},
booktitle = {Proceedings of the 2013 {IEEE} International Symposium on Information
Theory, Istanbul, Turkey, July 7-12, 2013},
pages = {136--140},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/ISIT.2013.6620203},
doi = {10.1109/ISIT.2013.6620203},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/KashyaptZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ShashankK13,
author = {V. Shashank and
Navin Kashyap},
title = {Lattice coding for strongly secure compute-and-forward in a bidirectional
relay},
booktitle = {Proceedings of the 2013 {IEEE} International Symposium on Information
Theory, Istanbul, Turkey, July 7-12, 2013},
pages = {2775--2779},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/ISIT.2013.6620731},
doi = {10.1109/ISIT.2013.6620731},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/ShashankK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/FernandesK13,
author = {Winston Fernandes and
Navin Kashyap},
title = {A phase transition for the uniform distribution in the pattern maximum
likelihood problem},
booktitle = {2013 {IEEE} Information Theory Workshop, {ITW} 2013, Sevilla, Spain,
September 9-13, 2013},
pages = {1--5},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/ITW.2013.6691277},
doi = {10.1109/ITW.2013.6691277},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/itw/FernandesK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/ShivkumarK13,
author = {K. Manickam Shivkumar and
Navin Kashyap},
title = {On 2-D non-adjacent-error channel models},
booktitle = {2013 {IEEE} Information Theory Workshop, {ITW} 2013, Sevilla, Spain,
September 9-13, 2013},
pages = {1--5},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/ITW.2013.6691319},
doi = {10.1109/ITW.2013.6691319},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itw/ShivkumarK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6154,
author = {Navin Kashyap and
Gilles Z{\'{e}}mor},
title = {Upper Bounds on the Size of Grain-Correcting Codes},
journal = {CoRR},
volume = {abs/1302.6154},
year = {2013},
url = {http://arxiv.org/abs/1302.6154},
eprinttype = {arXiv},
eprint = {1302.6154},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6154.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapT12,
author = {Navin Kashyap and
Andrew Thangaraj},
title = {The Treewidth of {MDS} and Reed-Muller Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {58},
number = {7},
pages = {4837--4847},
year = {2012},
url = {https://doi.org/10.1109/TIT.2012.2191935},
doi = {10.1109/TIT.2012.2191935},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KashyapST12,
author = {Navin Kashyap and
V. Shashank and
Andrew Thangaraj},
title = {Secure computation in a bidirectional relay},
booktitle = {Proceedings of the 2012 {IEEE} International Symposium on Information
Theory, {ISIT} 2012, Cambridge, MA, USA, July 1-6, 2012},
pages = {1162--1166},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/ISIT.2012.6283036},
doi = {10.1109/ISIT.2012.6283036},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/KashyapST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/TyagiKSV12,
author = {Himanshu Tyagi and
Navin Kashyap and
Yogesh Sankarasubramaniam and
Kapali Viswanathan},
title = {Fault-tolerant secret key generation},
booktitle = {Proceedings of the 2012 {IEEE} International Symposium on Information
Theory, {ISIT} 2012, Cambridge, MA, USA, July 1-6, 2012},
pages = {1787--1791},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/ISIT.2012.6283586},
doi = {10.1109/ISIT.2012.6283586},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/TyagiKSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-3392,
author = {Navin Kashyap and
V. Shashank and
Andrew Thangaraj},
title = {Secure Compute-and-Forward in a Bidirectional Relay},
journal = {CoRR},
volume = {abs/1206.3392},
year = {2012},
url = {http://arxiv.org/abs/1206.3392},
eprinttype = {arXiv},
eprint = {1206.3392},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-3392.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nc/MengK11,
author = {Ya Meng and
Navin Kashyap},
title = {The effect of malformed tiles on tile assemblies within the kinetic
tile assembly model},
journal = {Nat. Comput.},
volume = {10},
number = {1},
pages = {357--373},
year = {2011},
url = {https://doi.org/10.1007/s11047-010-9234-9},
doi = {10.1007/S11047-010-9234-9},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nc/MengK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MazumdarBK11,
author = {Arya Mazumdar and
Alexander Barg and
Navin Kashyap},
title = {Coding for High-Density Recording on a 1-D Granular Magnetic Medium},
journal = {{IEEE} Trans. Inf. Theory},
volume = {57},
number = {11},
pages = {7403--7417},
year = {2011},
url = {https://doi.org/10.1109/TIT.2011.2158514},
doi = {10.1109/TIT.2011.2158514},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/MazumdarBK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KashyapT11,
author = {Navin Kashyap and
Andrew Thangaraj},
editor = {Alexander Kuleshov and
Vladimir M. Blinovsky and
Anthony Ephremides},
title = {On the treewidth of {MDS} and Reed-Muller codes},
booktitle = {2011 {IEEE} International Symposium on Information Theory Proceedings,
{ISIT} 2011, St. Petersburg, Russia, July 31 - August 5, 2011},
pages = {1925--1929},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/ISIT.2011.6033887},
doi = {10.1109/ISIT.2011.6033887},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/KashyapT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-2734,
author = {Navin Kashyap and
Andrew Thangaraj},
title = {On the Treewidth of {MDS} and Reed-Muller Codes},
journal = {CoRR},
volume = {abs/1102.2734},
year = {2011},
url = {http://arxiv.org/abs/1102.2734},
eprinttype = {arXiv},
eprint = {1102.2734},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-2734.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/MazumdarBK10,
author = {Arya Mazumdar and
Alexander Barg and
Navin Kashyap},
title = {On the capacity of high-density recording on a 1-D granular magnetic
medium},
booktitle = {48th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2010, Monticello, IL, USA, September 29 - October 1, 2020},
pages = {368--375},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/ALLERTON.2010.5706930},
doi = {10.1109/ALLERTON.2010.5706930},
timestamp = {Fri, 24 Nov 2023 19:40:40 +0100},
biburl = {https://dblp.org/rec/conf/allerton/MazumdarBK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MazumdarBK10,
author = {Arya Mazumdar and
Alexander Barg and
Navin Kashyap},
title = {Coding for high-density magnetic recording},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2010,
June 13-18, 2010, Austin, Texas, USA, Proceedings},
pages = {978--982},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/ISIT.2010.5513783},
doi = {10.1109/ISIT.2010.5513783},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/MazumdarBK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/FarnoudCMK10,
author = {Farzad Farnoud and
Chien{-}Yu Chen and
Olgica Milenkovic and
Navin Kashyap},
editor = {Marcus Greferath and
Joachim Rosenthal and
Alexander Barg and
Gilles Z{\'{e}}mor},
title = {A graphical model for computing the minimum cost transposition distance},
booktitle = {2010 {IEEE} Information Theory Workshop, {ITW} 2010, Dublin, Ireland,
August 30 - September 3, 2010},
pages = {1--5},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/CIG.2010.5592890},
doi = {10.1109/CIG.2010.5592890},
timestamp = {Mon, 09 Aug 2021 14:54:02 +0200},
biburl = {https://dblp.org/rec/conf/itw/FarnoudCMK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-1895,
author = {Arya Mazumdar and
Alexander Barg and
Navin Kashyap},
title = {Coding for High-Density Recording on a 1-D Granular Magnetic Medium},
journal = {CoRR},
volume = {abs/1012.1895},
year = {2010},
url = {http://arxiv.org/abs/1012.1895},
eprinttype = {arXiv},
eprint = {1012.1895},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-1895.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ManadaK09,
author = {Akiko Manada and
Navin Kashyap},
title = {A Comparative Study of Periods in a Periodic-Finite-Type Shift},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {3},
pages = {1507--1524},
year = {2009},
url = {https://doi.org/10.1137/080739197},
doi = {10.1137/080739197},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ManadaK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapN09,
author = {Navin Kashyap and
David L. Neuhoff},
title = {Data Synchronization With Timing: The Variable-Rate Case},
journal = {{IEEE} Trans. Inf. Theory},
volume = {55},
number = {1},
pages = {46--52},
year = {2009},
url = {https://doi.org/10.1109/TIT.2008.2008113},
doi = {10.1109/TIT.2008.2008113},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Kashyap09,
author = {Navin Kashyap},
title = {On minimal tree realizations of linear codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {55},
number = {8},
pages = {3501--3519},
year = {2009},
url = {https://doi.org/10.1109/TIT.2009.2023718},
doi = {10.1109/TIT.2009.2023718},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Kashyap09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Kashyap09a,
author = {Navin Kashyap},
title = {Constraint complexity of realizations of linear codes on arbitrary
graphs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {55},
number = {11},
pages = {4864--4877},
year = {2009},
url = {https://doi.org/10.1109/TIT.2009.2030492},
doi = {10.1109/TIT.2009.2030492},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Kashyap09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/MengK09,
author = {Ya Meng and
Navin Kashyap},
title = {Controlling errors in the process of molecular self-assembly},
booktitle = {47th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009},
pages = {676--677},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ALLERTON.2009.5394927},
doi = {10.1109/ALLERTON.2009.5394927},
timestamp = {Wed, 29 Nov 2023 20:15:57 +0100},
biburl = {https://dblp.org/rec/conf/allerton/MengK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dna/MengK09,
author = {Ya Meng and
Navin Kashyap},
editor = {Russell J. Deaton and
Akira Suyama},
title = {The Effect of Malformed Tiles on Tile Assemblies within kTAM},
booktitle = {{DNA} Computing and Molecular Programming, 15th International Conference,
{DNA} 15, Fayetteville, AR, USA, June 8-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5877},
pages = {116--125},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10604-0\_12},
doi = {10.1007/978-3-642-10604-0\_12},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dna/MengK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KashyapM09,
author = {Navin Kashyap and
Akiko Manada},
title = {The zeta function of a periodic-finite-type shift},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2009,
June 28 - July 3, 2009, Seoul, Korea, Proceedings},
pages = {1569--1573},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ISIT.2009.5205825},
doi = {10.1109/ISIT.2009.5205825},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/KashyapM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-2375,
author = {Akiko Manada and
Navin Kashyap},
title = {The Zeta Function of a Periodic-Finite-Type Shift},
journal = {CoRR},
volume = {abs/0904.2375},
year = {2009},
url = {http://arxiv.org/abs/0904.2375},
eprinttype = {arXiv},
eprint = {0904.2375},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-2375.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/icl/CohenAKT08,
author = {Adam Cohen and
Fady Alajaji and
Navin Kashyap and
Glen Takahara},
title = {{LP} Decoding for Joint Source-Channel Codes and for the Non-Ergodic
Polya Channel},
journal = {{IEEE} Commun. Lett.},
volume = {12},
number = {9},
pages = {678--680},
year = {2008},
url = {https://doi.org/10.1109/LCOMM.2008.080713},
doi = {10.1109/LCOMM.2008.080713},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/icl/CohenAKT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kashyap08,
author = {Navin Kashyap},
title = {Matroid Pathwidth and Code Trellis Complexity},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {1},
pages = {256--272},
year = {2008},
url = {https://doi.org/10.1137/070691152},
doi = {10.1137/070691152},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kashyap08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Kashyap08,
author = {Navin Kashyap},
title = {A Decomposition Theory for Binary Linear Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {54},
number = {7},
pages = {3035--3058},
year = {2008},
url = {https://doi.org/10.1109/TIT.2008.924700},
doi = {10.1109/TIT.2008.924700},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Kashyap08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ManadaK08,
author = {Akiko Manada and
Navin Kashyap},
editor = {Frank R. Kschischang and
En{-}Hui Yang},
title = {On the period of a periodic-finite-type shift},
booktitle = {2008 {IEEE} International Symposium on Information Theory, {ISIT}
2008, Toronto, ON, Canada, July 6-11, 2008},
pages = {1453--1457},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ISIT.2008.4595228},
doi = {10.1109/ISIT.2008.4595228},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/ManadaK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0801-1060,
author = {Akiko Manada and
Navin Kashyap},
title = {On the Period of a Periodic-Finite-Type Shift},
journal = {CoRR},
volume = {abs/0801.1060},
year = {2008},
url = {http://arxiv.org/abs/0801.1060},
eprinttype = {arXiv},
eprint = {0801.1060},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0801-1060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-2199,
author = {Navin Kashyap},
title = {Constraint Complexity of Realizations of Linear Codes on Arbitrary
Graphs},
journal = {CoRR},
volume = {abs/0805.2199},
year = {2008},
url = {http://arxiv.org/abs/0805.2199},
eprinttype = {arXiv},
eprint = {0805.2199},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-2199.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/Kashyap07,
author = {Navin Kashyap},
editor = {Serdar Boztas and
Hsiao{-}feng Lu},
title = {The "Art of Trellis Decoding" Is NP-Hard},
booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
17th International Symposium, AAECC-17, Bangalore, India, December
16-20, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4851},
pages = {198--207},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77224-8\_24},
doi = {10.1007/978-3-540-77224-8\_24},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/aaecc/Kashyap07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/Kashyap07,
author = {Navin Kashyap},
title = {Code Decomposition: Theory and Applications},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007,
Nice, France, June 24-29, 2007},
pages = {481--485},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/ISIT.2007.4557271},
doi = {10.1109/ISIT.2007.4557271},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/Kashyap07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0705-1384,
author = {Navin Kashyap},
title = {Matroid Pathwidth and Code Trellis Complexity},
journal = {CoRR},
volume = {abs/0705.1384},
year = {2007},
url = {http://arxiv.org/abs/0705.1384},
eprinttype = {arXiv},
eprint = {0705.1384},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0705-1384.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-1383,
author = {Navin Kashyap},
title = {On Minimal Tree Realizations of Linear Codes},
journal = {CoRR},
volume = {abs/0711.1383},
year = {2007},
url = {http://arxiv.org/abs/0711.1383},
eprinttype = {arXiv},
eprint = {0711.1383},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-1383.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapSV06,
author = {Navin Kashyap and
Paul H. Siegel and
Alexander Vardy},
title = {Coding for the optical channel: the ghost-pulse constraint},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {1},
pages = {64--77},
year = {2006},
url = {https://doi.org/10.1109/TIT.2005.860409},
doi = {10.1109/TIT.2005.860409},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapN06,
author = {Navin Kashyap and
David L. Neuhoff},
title = {Periodic prefix-synchronized codes: {A} generating function approach},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {2},
pages = {538--548},
year = {2006},
url = {https://doi.org/10.1109/TIT.2005.862099},
doi = {10.1109/TIT.2005.862099},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MilenkovicKL06,
author = {Olgica Milenkovic and
Navin Kashyap and
David Leyba},
title = {Shortened Array Codes of Large Girth},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {8},
pages = {3707--3722},
year = {2006},
url = {https://doi.org/10.1109/TIT.2006.878179},
doi = {10.1109/TIT.2006.878179},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/MilenkovicKL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ManadaK06,
author = {Akiko Manada and
Navin Kashyap},
title = {On the Shannon Covers of Certain Irreducible Constrained Systems of
Finite Type},
booktitle = {Proceedings 2006 {IEEE} International Symposium on Information Theory,
{ISIT} 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14,
2006},
pages = {1477--1481},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/ISIT.2006.262113},
doi = {10.1109/ISIT.2006.262113},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/ManadaK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604104,
author = {Akiko Manada and
Navin Kashyap},
title = {On the Shannon Covers of Certain Irreducible Constrained Systems of
Finite Type},
journal = {CoRR},
volume = {abs/cs/0604104},
year = {2006},
url = {http://arxiv.org/abs/cs/0604104},
eprinttype = {arXiv},
eprint = {cs/0604104},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0611028,
author = {Navin Kashyap},
title = {A Decomposition Theory for Binary Linear Codes},
journal = {CoRR},
volume = {abs/cs/0611028},
year = {2006},
url = {http://arxiv.org/abs/cs/0611028},
eprinttype = {arXiv},
eprint = {cs/0611028},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0611028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KashyapSV05,
author = {Navin Kashyap and
Paul H. Siegel and
Alexander Vardy},
title = {An Application of Ramsey Theory to Coding for the Optical Channel},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {921--937},
year = {2005},
url = {https://doi.org/10.1137/S089548010444585X},
doi = {10.1137/S089548010444585X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KashyapSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cdc/MilenkovicKV05,
author = {Olgica Milenkovic and
Navin Kashyap and
Bane Vasic},
title = {On {DNA} Computers Controlling Gene Expression Levels},
booktitle = {44th {IEEE} {IEEE} Conference on Decision and Control and 8th European
Control Conference Control, {CDC/ECC} 2005, Seville, Spain, 12-15
December, 2005},
pages = {1770--1775},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/CDC.2005.1582416},
doi = {10.1109/CDC.2005.1582416},
timestamp = {Fri, 04 Mar 2022 13:25:54 +0100},
biburl = {https://dblp.org/rec/conf/cdc/MilenkovicKV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MilenkovicK05,
author = {Olgica Milenkovic and
Navin Kashyap},
title = {{DNA} codes that avoid secondary structures},
booktitle = {Proceedings of the 2005 {IEEE} International Symposium on Information
Theory, {ISIT} 2005, Adelaide, South Australia, Australia, 4-9 September
2005},
pages = {288--292},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/ISIT.2005.1523340},
doi = {10.1109/ISIT.2005.1523340},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/MilenkovicK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wcc/MilenkovicK05,
author = {Olgica Milenkovic and
Navin Kashyap},
editor = {{\O}yvind Ytrehus},
title = {On the Design of Codes for {DNA} Computing},
booktitle = {Coding and Cryptography, International Workshop, {WCC} 2005, Bergen,
Norway, March 14-18, 2005. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3969},
pages = {100--119},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11779360\_9},
doi = {10.1007/11779360\_9},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wcc/MilenkovicK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504016,
author = {Olgica Milenkovic and
Navin Kashyap and
David Leyba},
title = {Shortened Array Codes of Large Girth},
journal = {CoRR},
volume = {abs/cs/0504016},
year = {2005},
url = {http://arxiv.org/abs/cs/0504016},
eprinttype = {arXiv},
eprint = {cs/0504016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0508055,
author = {Olgica Milenkovic and
Navin Kashyap},
title = {{DNA} Codes that Avoid Secondary Structures},
journal = {CoRR},
volume = {abs/cs/0508055},
year = {2005},
url = {http://arxiv.org/abs/cs/0508055},
eprinttype = {arXiv},
eprint = {cs/0508055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0508055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0510033,
author = {Navin Kashyap and
Paul H. Siegel and
Alexander Vardy},
title = {Coding for the Optical Channel: the Ghost-Pulse Constraint},
journal = {CoRR},
volume = {abs/cs/0510033},
year = {2005},
url = {http://arxiv.org/abs/cs/0510033},
eprinttype = {arXiv},
eprint = {cs/0510033},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0510033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapS04,
author = {Navin Kashyap and
Paul H. Siegel},
title = {Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited
Constraints of Equal Capacity},
journal = {{IEEE} Trans. Inf. Theory},
volume = {50},
number = {6},
pages = {1327--1331},
year = {2004},
url = {https://doi.org/10.1109/TIT.2004.828145},
doi = {10.1109/TIT.2004.828145},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/KashyapS04,
author = {Navin Kashyap and
Paul H. Siegel},
editor = {Paul H. Siegel and
Emina Soljanin and
Adriaan J. de Lind van Wijngaarden and
Bane Vasic},
title = {Ghostbusting: Coding for Optical Communications},
booktitle = {Advances in Information Recording, Proceedings of a {DIMACS} Workshop,
New Brunswick, New Jersey, USA, March 22-24, 2004},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {73},
pages = {147--162},
publisher = {{DIMACS/AMS}},
year = {2004},
url = {https://doi.org/10.1090/dimacs/073/07},
doi = {10.1090/DIMACS/073/07},
timestamp = {Mon, 17 Jul 2023 11:11:53 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/KashyapS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KashyapS04,
author = {Navin Kashyap and
Paul H. Siegel},
title = {Sliding-block decodable encoders between (d, k)-constrained systems
of equal capacity},
booktitle = {Proceedings of the 2004 {IEEE} International Symposium on Information
Theory, {ISIT} 2004, Chicago Downtown Marriott, Chicago, Illinois,
USA, June 27 - July 2, 2004},
pages = {87},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ISIT.2004.1365124},
doi = {10.1109/ISIT.2004.1365124},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/KashyapS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KashyapSV04,
author = {Navin Kashyap and
Paul H. Siegel and
Alexander Vardy},
title = {A Ramsey theory approach to ghostbusting},
booktitle = {Proceedings of the 2004 {IEEE} International Symposium on Information
Theory, {ISIT} 2004, Chicago Downtown Marriott, Chicago, Illinois,
USA, June 27 - July 2, 2004},
pages = {190},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ISIT.2004.1365230},
doi = {10.1109/ISIT.2004.1365230},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/KashyapSV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KashyapS03,
author = {Navin Kashyap and
Paul H. Siegel},
title = {Equalities among Capacities of (d, k)-Constrained Systems},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {2},
pages = {276--297},
year = {2003},
url = {https://doi.org/10.1137/S0895480102413710},
doi = {10.1137/S0895480102413710},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KashyapS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kashyap03,
author = {Navin Kashyap},
title = {Maximizing the Shannon Capacity of Constrained Systems with Two Constraints},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {2},
pages = {298--319},
year = {2003},
url = {https://doi.org/10.1137/S0895480102402757},
doi = {10.1137/S0895480102402757},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kashyap03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapN01,
author = {Navin Kashyap and
David L. Neuhoff},
title = {Data synchronization with timing},
journal = {{IEEE} Trans. Inf. Theory},
volume = {47},
number = {4},
pages = {1444--1460},
year = {2001},
url = {https://doi.org/10.1109/18.923726},
doi = {10.1109/18.923726},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KashyapN01a,
author = {Navin Kashyap and
David L. Neuhoff},
title = {On quantization with the Weaire-Phelan partition},
journal = {{IEEE} Trans. Inf. Theory},
volume = {47},
number = {6},
pages = {2538--2543},
year = {2001},
url = {https://doi.org/10.1109/18.945264},
doi = {10.1109/18.945264},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KashyapN01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/KashyapN99,
author = {Navin Kashyap and
David L. Neuhoff},
title = {Codes for Data Synchronization with Timing},
booktitle = {Data Compression Conference, {DCC} 1999, Snowbird, Utah, USA, March
29-31, 1999},
pages = {443--452},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/DCC.1999.755694},
doi = {10.1109/DCC.1999.755694},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/KashyapN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-16 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
