- Coding for High-Density Recording on a 1-D Granular Magnetic Medium
- ON MINIMAL TREE REALIZATIONS OF LINEAR CODES NAVIN KASHYAP
- Submitted to the IEEE TRANSACTIONS ON INFORMATION THEORY 1 Data Synchronization with Timing
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL., NO., MONTH, YEAR 1 Periodic Prefix-Synchronized Codes
- THE ZETA FUNCTION OF A PERIODIC-FINITE-TYPE SHIFT AKIKO MANADA AND NAVIN KASHYAP
- The "Art of Trellis Decoding" is NP-Hard Navin Kashyap
- On Codes of Bounded Trellis Complexity Navin Kashyap
- Coding for HighDensity Magnetic Recording Arya Mazumdar # Alexander Barg #,# Navin Kashyap +
- The ``Art of Trellis Decoding'' is NPHard # Navin Kashyap
- On the Convex Geometry of Binary Linear Codes Navin Kashyap
- Stopping Sets in Codes from Designs1 Navin Kashyap Alexander Vardy
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL., NO., MONTH, YEAR 1 Periodic PrefixSynchronized Codes
- Revised version, submitted to the IEEE TRANSACTIONS ON INFORMATION THEORY, January 17, 2006 1 Coding for the Optical Channel
- Submitted to the IEEE TRANSACTIONS ON INFORMATION THEORY 1 Data Synchronization with Timing
- AN APPLICATION OF RAMSEY THEORY TO CODING FOR THE OPTICAL CHANNEL
- THE ZETA FUNCTION OF A PERIODICFINITETYPE SHIFT # AKIKO MANADA + AND NAVIN KASHYAP #
- On Codes of Bounded Trellis Complexity # Navin Kashyap
- CONSTRAINT COMPLEXITY OF REALIZATIONS OF LINEAR CODES ON ARBITRARY GRAPHS
- MAXIMIZING THE SHANNON CAPACITY OF CONSTRAINED SYSTEMS WITH TWO CONSTRAINTS
- Sliding-Block Decodable Encoders Between (d; k) Runlength-Limited
- AN APPLICATION OF RAMSEY THEORY TO CODING FOR THE OPTICAL CHANNEL #
- Stopping Sets in Codes from Designs 1 Navin Kashyap Alexander Vardy
- CONSTRAINT COMPLEXITY OF REALIZATIONS OF LINEAR CODES ON ARBITRARY GRAPHS
- Natural Computing manuscript No. (will be inserted by the editor)
- Shortened Array Codes of Large Girth # Olgica Milenkovic David Leyba
- Natural Computing manuscript No. (will be inserted by the editor)
- Coding for HighDensity Recording on a 1D Granular Magnetic Medium
- ON MINIMAL TREE REALIZATIONS OF LINEAR CODES NAVIN KASHYAP
- Revised version, submitted to the IEEE TRANSACTIONS ON INFORMATION THEORY, January 17, 2006 1 Coding for the Optical Channel
- EQUALITIES AMONG CAPACITIES OF (D; K)-CONSTRAINED NAVIN KASHYAP y AND PAUL H. SIEGEL y
- Enumerating Annihilator Polynomials over Zn Navin Kashyap
- On the Convex Geometry of Binary Linear Codes Navin Kashyap
- Enumerating Annihilator Polynomials over Z n Navin Kashyap + Alexander Vardy +
- Coding for High-Density Magnetic Recording Arya Mazumdar Alexander Barg, Navin Kashyap
- A COMPARATIVE STUDY OF PERIODS IN A PERIODIC-FINITE-TYPE SHIFT
