Publications & Preprints


Journals
  • Sequentially encodable codeword stabilized codes, S. Sudevan, S. Das, T. Aswanth and N. Kashyap, submitted to IEEE Trans. Inf. Theory, May 2024. [arXiv]
  • Sampling-based estimates of the weight enumerators of Reed-Muller codes, V. A. Rameshwar, S. Jain and N. Kashyap, submitted to IEEE Trans. Inf. Theory, Mar. 2024. [arXiv]
  • Degree-M Bethe and Sinkhorn permanent based bounds on the permanent of a non-negative matrix, Y. Huang, N. Kashyap and P.O. Vontobel, IEEE Trans. Inf. Theory, vol. 70, no. 7, pp. 5289-5308, July 2024. [IEEE Xplore] [arXiv]
  • Wiretap secret key agreement via secure omniscience, Praneeth Kumar V., C. Chan, N. Kashyap, and Q. Zhou, IEEE Trans. Inform. Theory, vol. 69, no. 12, pp. 8029-8053, Dec. 2023. [IEEE Xplore] [arXiv]
  • Estimating the sizes of binary error-correcting constrained codes, V. Arvind Rameshwar and N. Kashyap, IEEE J. Selected Areas in Information Theory, vol. 4, pp. 144-158, 2023. [IEEE Xplore] [arXiv]
  • Coding schemes based on Reed-Muller codes for (d,\infty)-RLL input-constrained channels, V. Arvind Rameshwar and N. Kashyap, IEEE Trans. Inf. Theory, vol. 69, no. 11, pp. 7003-7024, Nov. 2023. [IEEE Xplore] [arXiv]
  • The secure storage capacity of a DNA wiretap channel model, Praneeth Kumar V. and N. Kashyap, IEEE Trans. Inf. Theory, vol. 69, no. 9, pp. 5550-5569, Sept. 2023. [IEEE Xplore] [arXiv]
  • An analysis of probabilistic forwarding of coded packets on random geometric graphs, B.R. Vinay Kumar, N. Kashyap and D. Yogeshwaran, Performance Evaluation, vol. 160, 102343, May 2023. [ScienceDirect] [arXiv]
  • Computable upper bounds on the capacity of finite-state channels, B. Huleihel, O. Sabag, H.H. Permuter, N. Kashyap, and S. Shamai, IEEE Trans. Inform. Theory, vol. 67, no. 9, pp. 5674-5692, Sept. 2021. [IEEE Xplore] [arXiv]
  • How many modes can a mixture of Gaussians with uniformly bounded means have?, N. Kashyap and M. Krishnapur, Information and Inference: A Journal of the IMA, iaab009, 2021. [Journal] [arXiv]
  • Deadline constrained packet scheduling in the presence of an energy harvesting jammer, H. Rahman, A. Vinayachandran, S.R.B. Pillai, K. Appaiah, R. Vaze, and N. Kashyap, IEEE Trans. Green Communications and Networking, vol. 5, no. 1, pp. 278-290, March 2021. [IEEE Xplore]
  • Probabilistic forwarding of coded packets on networks, B.R. Vinay Kumar and N. Kashyap, IEEE/ACM Trans. Networking, vol. 29, no. 1, pp. 234-247, Feb 2021. [IEEE Xplore] [arXiv]
  • Upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources, C. Chan, M. Mukherjee, N. Kashyap and Q. Zhou, IEEE Trans. Inform. Theory, vol. 65, no. 8, pp. 5080-5093, Aug. 2019. [IEEE Xplore] [arXiv]
  • Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint, O. Sabag, H. Permuter and N. Kashyap, IEEE Trans. Inform. Theory, vol. 64, no. 7, pp. 4940-4961, July 2018. [IEEE Xplore] [arXiv]
  • On the Optimality of Secret Key Agreement via Omniscience, C. Chan, M. Mukherjee, N. Kashyap and Q. Zhou, IEEE Trans. Inform. Theory, vol. 64, no. 4, pp. 2371-2389, April 2018. [IEEE Xplore] [arXiv]
  • Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and Its Bethe Approximation, C.L. Chan, W. Fernandes, N. Kashyap and M. Krishnapur, SIAM J. Discrete Math., vol. 31, no. 1, pp. 597-631, 2017. [SIAM ePubs] [pdf]
  • Some "Goodness Properties" of LDA Lattices, S. Vatedka and N. Kashyap, Problems of Information Transmission, vol. 53, no. 1, pp. 1-29, 2017. [SpringerLink] [arXiv]
  • MCMC Methods for Drawing Random Samples from the Discrete-Grains Model of a Magnetic Medium, A. Das and N. Kashyap, IEEE J. Sel. Areas Commun., vol. 34, no. 9, pp. 2430-2438, Sept. 2016. [IEEE Xplore] [pdf]
  • On the Public Communication Needed to Achieve SK Capacity within the Multiterminal Source Model, M. Mukherjee, N. Kashyap and Y. Sankarasubramaniam, IEEE Trans. Inform. Theory, vol. 62, no. 7, pp. 3811-3830, July 2016. [IEEE Xplore] [pdf]
  • The Feedback Capacity of the Binary Erasure Channel with a No-Consecutive-Ones Input Constraint, O. Sabag, H.H. Permuter and N. Kashyap, IEEE Trans. Inform. Theory, vol. 62, no. 1, pp. 8-22, Jan. 2016. [IEEE Xplore] [pdf]
  • Secure Compute-and-Forward in a Bidirectional Relay, Shashank V., N. Kashyap and A. Thangaraj, IEEE Trans. Inform. Theory, vol. 61, no. 5, pp. 2531-2556, May 2015. [IEEE Xplore] [pdf]
  • Upper Bounds on the Size of Grain-Correcting Codes, N. Kashyap and G. Zémor, IEEE Trans. Inform. Theory, vol. 60, no. 8, pp. 4699-4709, Aug. 2014. [IEEE Xplore] [pdf]
  • On The Zeta Function of a Periodic-Finite-Type Shift, A. Manada and N. Kashyap, IEICE Trans. Fundamentals (Special Section on Discrete Mathematics and Its Applications), vol. E96-A, no. 6, June 2013. [pdf]
  • The Treewidth of MDS and Reed-Muller Codes, N. Kashyap and A. Thangaraj, IEEE Trans. Inform. Theory, vol. 58, no. 7, pp. 4837-4847, July 2012. [IEEE Explore] [pdf]
  • Coding for High-Density Recording on a 1-D Granular Magnetic Medium, A. Mazumdar, A. Barg and N. Kashyap, IEEE Trans. Inform. Theory, vol. 57, no. 11, pp. 7403-7417, Nov. 2011. [IEEE Xplore] [pdf]
  • The Effect of Malformed Tiles on Tile Assemblies within the kinetic Tile Assembly Model, Y. Meng and N. Kashyap, Natural Computing, vol. 10, no. 1, pp. 357-373, March 2011. DOI 10.1007/s11047-010-9234-9, Nov. 2010 (online). [ps] [pdf]
  • A Comparative Study of Periods in a Periodic-Finite-Type Shift, A. Manada and N. Kashyap, SIAM J. Discrete Math., vol. 23, no. 3, pp. 1507-1524, 2009. [ps] [pdf]
  • Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs, N. Kashyap, IEEE Trans. Inform. Theory, vol. 55, no. 11, pp. 4864-4877, Nov. 2009. [ps] [pdf]
  • On Minimal Tree Realizations of Linear Codes, N. Kashyap, IEEE Trans. Inform. Theory, vol. 55, no. 8, pp. 3501-3519, Aug. 2009. [ps] [pdf]
  • Data Synchronization with Timing: The Variable-Rate Case, N. Kashyap and D.L. Neuhoff, IEEE Trans. Inform. Theory, vol. 55, no. 1, pp. 46-52, Jan. 2009. [ps] [pdf]
  • LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel, A. Cohen, F. Alajaji, N. Kashyap and G. Takahara, IEEE Comm. Letters, vol. 12, no. 9, pp. 678-680, Sept. 2008.
  • A Decomposition Theory for Binary Linear Codes, N. Kashyap, IEEE Trans. Inform. Theory, vol. 54, no. 7, pp. 3035-3058, July 2008. [ps] [pdf]
  • Matroid Pathwidth and Code Trellis Complexity, N. Kashyap, SIAM J. Discrete Math., vol. 22, no. 1, pp. 256-272, 2008. [ps] [pdf]
  • Shortened Array Codes of Large Girth, O. Milenkovic, N. Kashyap and D. Leyba, IEEE Trans. Inform. Theory, vol. 53, no. 8, pp. 3707-3722, Aug 2006. [ps] [pdf]
  • Periodic Prefix-Synchronized Codes: A Generating Function Approach, N. Kashyap and D.L. Neuhoff, IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 538-548, Feb. 2006. [ps] [pdf]
  • Coding for the Optical Channel --- the Ghost Pulse Constraint, N. Kashyap, P.H. Siegel and A. Vardy, IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 64-77, Jan. 2006. [ps] [pdf]
  • An Application of Ramsey Theory to Coding for the Optical Channel, N. Kashyap, P.H. Siegel and A. Vardy, SIAM J. Discrete Math, vol. 19, no. 4, pp. 921-937, 2005. [ps] [pdf]
  • Sliding-Block Decodable Encoders Between (d,k) Runlength-Limited Constraints of Equal Capacity, N. Kashyap and P.H. Siegel, IEEE Trans. Inform. Theory., vol. 50, no. 6, pp. 1327-1331, June 2004. [ps] [pdf]
  • Equalities among Capacities of (d,k)-Constrained Systems, N. Kashyap and P.H. Siegel, SIAM J. Discrete Math., vol. 17, no. 2, pp. 276-297, 2003. [ps] [pdf]
  • Maximizing the Shannon Capacity of Constrained Systems with Two Constraints, N. Kashyap, SIAM J. Discrete Math., vol. 17, no. 2, pp. 298-319, 2003. [ps] [pdf]
  • On Quantization with the Weaire-Phelan Partition, N. Kashyap and D.L. Neuhoff, IEEE Trans. Inform. Theory, vol. 47, no. 6, pp. 2538-2543, Sept. 2001.
  • Data Synchronization with Timing, N. Kashyap and D.L. Neuhoff, IEEE Trans. Inform. Theory, vol. 47, no. 4, pp. 1444-1460, May 2001.
Multi-Author Volumes
  • Ghostbusting: Coding for Optical Communications, N. Kashyap and P.H. Siegel, in Advances In Information Recording, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 73, pp. 147-162, American Mathematical Society, 2008.
  • On the Design of Codes for DNA Computing, O. Milenkovic and N. Kashyap, in Coding and Cryptography (Lecture Notes in Computer Science 3969), O. Ytrehus, ed., pp. 100-119, Springer Verlag, Berlin-Heidelberg, 2006. [pdf]
Conferences (no longer updated)
  • A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources, S. Vatedka and N. Kashyap, in Proc. 2016 Int. Symp. Inf. Theory (ISIT 2016), Barcelona, Spain, July 10-15, 2016. [arXiv]
  • Bounds on the Public Communication Needed to Achieve SK Capacity in the Hypergraphical Source Model, M. Mukherjee, C. Chan, N. Kashyap and Q. Zhou, in Proc. 2016 Int. Symp. Inf. Theory (ISIT 2016), Barcelona, Spain, July 10- 15, 2016. [arXiv]
  • A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity, S. Vatedka and N. Kashyap, in Proc. 2016 National Conference on Communications (NCC2016), Guwahati, India, March 4-6, 2016.
  • The Feedback Capacity of the Binary Symmetric Channel with a No-Consecutive-Ones Input Constraint, O. Sabag, H.H. Permuter, and N. Kashyap, in Proc. 53rd Allerton Conf. Commun. Contr. Comput., Monticello, Illinois, USA, Sept. 30 - Oct. 2, 2015.
  • The Communication Complexity of Achieving SK Capacity in a Class of PIN Models, M. Mukherjee and N. Kashyap, in Proc. 2015 IEEE Int. Symp. Inf. Theory (ISIT 2015), Hong Kong, China, June 2015. [arXiv]
  • Generalized Belief Propagation for Estimating the Partition Function of the 2D Ising Model, C.L. Chan, M. Jafari Siavoshani, S. Jaggi, N. Kashyap, and P.O. Vontobel, in Proc. 2015 IEEE Int. Symp. Inf. Theory (ISIT 2015), Hong Kong, China, June 2015.
  • Nested lattice codes for secure bidirectional relaying with asymmetric channel gains, S. Vatedka and N. Kashyap, in Proc. 2015 IEEE Information Theory Workshop (ITW 2015), Jerusalem, Israel, Apr. 26 - May 1, 2015; invited paper. [arXiv]
  • Some "goodness" properties of LDA lattices, S. Vatedka and N. Kashyap, in Proc. 2015 IEEE Information Theory Workshop (ITW 2015), Jerusalem, Israel, Apr. 26 - May 1, 2015.
  • Capacity of the (1,\infty)-RLL input-constrained erasure channel with feedback, O. Sabag, H.H. Permuter and N. Kashyap, in Proc. 2015 IEEE Information Theory Workshop (ITW 2015), Jerusalem, Israel, Apr. 26 - May 1, 2015.
  • On linear subspace codes closed under intersection, P. Basu and N. Kashyap, in Proc. 2015 National Conference on Communications (NCC 2015), Mumbai, India, Feb. 27-Mar. 1, 2015. [pdf]
  • On the communication complexity of secret key generation in the multiterminal source model, M. Mukherjee and N. Kashyap, in Proc. 2014 IEEE Int. Symp. Inform. Theory (ISIT 2014), Honolulu, Hawaii, USA, June 29-July 4, 2014, pp. 1151-1155. [pdf]
  • Achieving SK capacity in the source model: When must all terminals talk?, M. Mukherjee, N. Kashyap and Y. Sankarasubramaniam, in Proc. 2014 IEEE Int. Symp. Inform. Theory (ISIT 2014), Honolulu, Hawaii, USA, June 29-July 4, 2014, pp. 1156-1160. [pdf]
  • On 2-D Non-Adjacent-Error Channel Models, Shivkumar K.M. and N. Kashyap, in Proc. 2013 Information Theory Workshop (ITW 2013), Seville, Spain, Sept.~2013, pp. 534-538. [pdf]
  • A Phase Transition for the Uniform Distribution in the Pattern Maximum Likelihood Problem, W. Fernandes and N. Kashyap, in Proc. 2013 Information Theory Workshop (ITW 2013), Seville, Spain, pp. 318-322. [pdf]
  • Lattice Coding for Strongly Secure Compute-and-Forward in a Bidirectional Relay, Shashank V. and N. Kashyap, in Proc. 2013 IEEE Int. Symp. Inform. Theory (ISIT 2013), Istanbul, Turkey, July 7-12, 2013, pp. 2775-2779. [pdf]
  • Upper Bounds on the Size of Grain-Correcting Codes, N. Kashyap and G. Zémor, in Proc. 2013 IEEE Int. Symp. Inform. Theory (ISIT 2013), Istanbul, Turkey, July 7-12, 2013, pp. 136-140. [pdf]
  • On the Secret Key Capacity of the Harary Graph PIN Model, N. Kashyap, M. Mukherjee, and Y. Sankarasubramaniam, in Proc. 2013 National Conference on Communications (NCC 2013), New Delhi, India, Feb 15-17, 2013. [pdf]
  • Secure Computation in a Bidirectional Relay, N. Kashyap, Shashank V., and A. Thangaraj, Proc. 2012 IEEE Int. Symp. Inform. Theory (ISIT 2012), Cambridge, Mass., USA, July 1-6, 2012. [pdf]
  • Fault-Tolerant Secret Key Generation, H. Tyagi, N. Kashyap, Y. Sankarasubramanian, and K. Viswanathan, Proc. 2012 IEEE Int. Symp. Inform. Theory (ISIT 2012), Cambridge, Mass., USA, July 1-6, 2012. [pdf]
  • Jamming to Foil an Eavesdropper, N. Kashyap, Y. Sankarasubramaniam, and A. Thangaraj, Proc. 2012 National Conference on Communications (NCC 2012), Kharagpur, India, Feb 3-5, 2012. [pdf]
  • On the Treewidth of MDS and Reed-Muller Codes, N. Kashyap and A. Thangaraj, Proc. 2011 IEEE Int. Symp. Inform. Theory (ISIT 2011), St. Petersburg, Russia, July 31 - Aug. 5, 2011.
  • More on Coding for High-Density Magnetic Recording, A. Mazumdar, A. Barg and N. Kashyap, Proc. 48th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, USA, Sept. 29 - Oct. 1, 2010. [ps] [pdf]
  • A Graphical Model For Computing The Minimum Cost Transposition Distance, F. Farnoud (Hassanzadeh), O. Milenkovic, N. Kashyap, Proc. 2010 Information Theory Workshop (ITW 2010), Dublin, Ireland, Aug. 30 - Sept. 3, 2010.
  • Coding for High-Density Magnetic Recording, A. Mazumdar, A. Barg and N. Kashyap, Proc. 2010 IEEE Int. Symp. Inform. Theory (ISIT 2010), Austin, Texas, USA, June 13-18, 2010.
  • The Zeta Function of a Periodic-Finite-Type Shift, A. Manada and N. Kashyap, Proc. 2009 IEEE Int. Symp. Inform. Theory (ISIT 2009), Seoul, Korea, pp. 1569-1573, June/July 2009. (Extended version: [ps] [pdf])
  • The Effect of Malformed Tiles on Tile Assemblies within kTAM, Y. Meng and N. Kashyap, in Proc. 15th International Meeting on DNA Computing and Molecular Programming (DNA15), Fayetteville, Arkansas, USA, June 8-12, 2009. Lecture Notes in Computer Science 5877, R. Deaton and A. Suyama, eds., pp. 116-125, Springer, Berlin-Heidelberg, 2009.
  • The Vertex-Cut Bound and Its Applications, N. Kashyap, in Proc. 2008 Int. Symp. Inform. Theory and its Applications (ISITA 2008), Auckland, New Zealand, Dec. 7-10, 2008.
  • On the Period of a Periodic-Finite-Type Shift, A. Manada and N. Kashyap, in Proc. 2008 IEEE Intl. Symp. Inform. Theory (ISIT 2008), Toronto, ON, Canada, pp. 1453-1457, July 2008.
  • The "Art of Trellis Decoding" is NP-Hard, N. Kashyap, in Proc. 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes Symposium (AAECC-17), Bangalore, India, Dec. 2007. Lecture Notes in Computer Science 4851, S. Boztas and H.-F. Lu, eds., pp. 198-207, Springer Verlag, Berlin-Heidelberg, 2007. [Preprint: ps, pdf]
  • On Codes of Bounded Trellis Complexity, N. Kashyap, Proc. 2007 IEEE Information Theory Workshop (ITW 2007), Lake Tahoe, CA, USA, pp. 168-173, Sept. 2007. [Preprint: ps, pdf]
  • Code Decomposition: Theory and Applications, N. Kashyap, Proc. 2007 IEEE Intl. Symp. Inform. Theory (ISIT 2007), Nice, France, pp. 481-485, June 2007.
  • On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type, A. Manada and N. Kashyap, Proc. 2006 IEEE Intl. Symp. Inform. Theory (ISIT 2006), Seattle, WA, USA, pp. 1477-1481, July 2006.
  • On the Convex Geometry of Binary Linear Codes, N. Kashyap, presented at the Inaugural UC-San Diego Workshop on Information Theory and its Applications, La Jolla, CA, USA, Feb. 6-10, 2006. [ps] [pdf]
  • On DNA Computers Controlling Gene Expression Levels, O. Milenkovic and N. Kashyap, Proc. 44th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC'05), Seville, Spain, pp. 1770-1775, Dec. 12-15, 2005.
  • DNA Codes that Avoid Secondary Structures, O. Milenkovic and N. Kashyap, Proc. 2005 IEEE Intl. Symp. Inform. Theory (ISIT 2005), Adelaide, Australia, pp. 288-292, Sept. 4-9, 2005.
  • New Constructions of Codes for DNA Computing, O. Milenkovic and N. Kashyap, Proc. 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, pp. 204-213, March 14-18, 2005.
  • New Partition Regular Integer Sequences and Array Codes of Large Girth, O. Milenkovic, D. Leyba, D. Bennett and N. Kashyap, Proc. 42nd Annual Allerton Conference on Communication, Control and Computing, pp. 240-249, Sept. 2004.
  • A Ramsey Theory Approach to Ghostbusting, N. Kashyap, P.H. Siegel and A. Vardy, Proc. IEEE Intl. Symp. Inform. Theory (ISIT), Chicago, USA, p. 190, June 2004.
  • Sliding-Block Decodable Encoders Between (d,k)-Constrained Systems of Equal Capacity, N. Kashyap and P.H. Siegel, Proc. IEEE Intl. Symp. Inform. Theory (ISIT), Chicago, USA, p. 87. June 2004.
  • Constrained Coding for the Optical Medium, N. Kashyap, Proc. 22nd Queen's Biennial Symposium on Communications, Kingston, Ontario, pp. 127-129, June 1-3, 2004.
  • Ghostbusting - Constrained Coding for Optical Communications, N. Kashyap and P.H. Siegel, DIMACS Workshop On Theoretical Advances In Information Recording, March 25-26, 2004 (invited talk).
  • Capacity Equalities in 1-Dimensional (d,k)-Constrained Systems, N. Kashyap and P.H. Siegel, Proc. IEEE Intl. Symp. Inform. Theory (ISIT), Yokohama, Japan, p. 105, July 2003.
  • Stopping Sets in Codes from Designs, N. Kashyap and A. Vardy, Proc. IEEE Intl. Symp. Inform. Theory (ISIT), Yokohama, Japan, p. 122, July 2003.
  • Maximizing the Capacity of Constrained Systems that Forbid Two Sequences, N. Kashyap, Proc. IEEE Intl. Symp. Inform. Theory, Lausanne, Switzerland, p. 355, July 2002.
  • On the Potential Optimality of the Weaire-Phelan Partition, N. Kashyap and D.L. Neuhoff, Proc. IEEE Intl. Symp. Inform. Theory, Washington D.C., p. 184, June 2001.
  • Variable-rate Codes for Synchronization with Timing, N. Kashyap and D.L. Neuhoff, Proc. IEEE Intl. Symp. Inform. Theory, Sorrento, Italy, p. 427, June 2000.
  • Codes for Data Synchronization and Timing, N. Kashyap and D.L. Neuhoff, Proc. IEEE Information Theory Workshop, Kruger National Park, South Africa, pp. 63-65, June 1999.
  • Codes for Data Synchronization with Timing, N. Kashyap and D.L. Neuhoff, Proc. Data Compression Conference (DCC '99), Snowbird, Utah, pp. 443-452, March 1999.
  • Expert System Algorithms for EMC Analysis, T. Hubing, N. Kashyap, J. Drewniak, T. Van Doren and R. DuBroff, Proc. 14th Annual Review of Progress in Applied Computational Electromagnetics, Monterey, CA, pp. 905-910, March 1998.
  • An Expert System for Predicting Radiated EMI from PCB's, N. Kashyap, T. Hubing, J. Drewniak, and T. Van Doren, Proc. IEEE International Symposium on Electromagnetic Compatibility, Austin, TX, pp. 444-449, Aug 1997.
  • An Expert System Approach to EMC Modeling, T. Hubing, J. Drewniak, T. Van Doren, and N. Kashyap, Proc. IEEE International Symposium on Electromagnetic Compatibility, Santa Clara, CA, pp. 200-203, Aug 1996.
Preprints Unlikely Ever To See The Light of Day
  • Improving the Performance of Nested Lattice Codes Using Concatenation, S. Vatedka and N. Kashyap. [arXiv]
  • Regular Codes are Not Asymptotically Good, N. Kashyap. [ps] [pdf]
  • On the Convex Geometry of Binary Linear Codes, N. Kashyap. [ps] [pdf]
  • Enumerating Annihilator Polynomials over Integer Rings, N. Kashyap and A. Vardy. [ps] [pdf]
  • Stopping Sets in Codes from Designs, N. Kashyap and A. Vardy. [ps] [pdf]

Back to Navin's home page.