P. Vijay Kumar

According to our database1, P. Vijay Kumar authored at least 181 papers between 1983 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures.
IEEE Trans. Inf. Theory, 2020

A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures.
IEEE Trans. Inf. Theory, 2020

Simple Streaming Codes for Reliable, Low-Latency Communication.
IEEE Commun. Lett., 2020

Codes for Distributed Storage.
CoRR, 2020

On Sliding Window Approximation of Gilbert-Elliott Channel for Delay Constrained Setting.
CoRR, 2020

Staggered Diagonal Embedding Based Linear Field Size Streaming Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Codes With Locality for Two Erasures.
IEEE Trans. Inf. Theory, 2019

Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures.
CoRR, 2019

Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Coded MapReduce Schemes Based on Placement Delivery Array.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Information-Theoretically Secure Erasure Codes for Distributed Storage.
IEEE Trans. Inf. Theory, 2018

Solomon W. Golomb - Mathematician, Engineer, and Pioneer.
IEEE Trans. Inf. Theory, 2018

Exploiting Locality for Improved Decoding of Binary Cyclic Codes.
IEEE Trans. Commun., 2018

Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions.
CoRR, 2018

Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code.
CoRR, 2018

Codes with Combined Locality and Regeneration Having Optimal Rate, d<sub>min</sub> and Linear Field Size.
CoRR, 2018

A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length.
CoRR, 2018

Erasure coding for distributed storage: an overview.
Sci. China Inf. Sci., 2018

Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\min}$ and Linear Field Size.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Clay Codes: Moulding MDS Codes to Yield an MSR Code.
Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

2017
Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval.
CoRR, 2017

An Optical-Camera Complement to a PIR Sensor Array for Intrusion Detection and Classfication in an Outdoor Environment.
Proceedings of the 42nd IEEE Conference on Local Computer Networks Workshops, 2017

An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n - 1).
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A study on the impact of locality in the decoding of binary cyclic codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Bounds on the rate and minimum distance of codes with availability.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Comparing chirplet-based classification with alternate feature-extraction approaches for outdoor intrusion detection using a pir sensor platform.
Proceedings of the 2017 International Conference on Advances in Computing, 2017

2016
Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes.
Int. J. Inf. Coding Theory, 2016

Animation and Chirplet-Based Development of a PIR Sensor Array for Intruder Classification in an Outdoor Environment.
CoRR, 2016

An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair.
CoRR, 2016

Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes.
CoRR, 2016

Binary Codes with Locality for Four Erasures.
CoRR, 2016

A Bound on Rate of Codes with Locality with Sequential Recovery from Multiple Erasures.
CoRR, 2016

Bounds on Codes with Locality and Availability.
CoRR, 2016

Challenges in Developing and Deploying a PIR Sensor-Based Intrusion Classification System for an Outdoor Environment.
Proceedings of the 41st IEEE Conference on Local Computer Networks Workshops, 2016

On MBR codes with replication.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Binary codes with locality for multiple erasures having short block length.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs.
IEEE Trans. Inf. Theory, 2015

An alternate construction of an access-optimal regenerating code with optimal sub-packetization level.
Proceedings of the Twenty First National Conference on Communications, 2015

Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

An animation-and-chirplet based approach to intruder classification using PIR sensing.
Proceedings of the Tenth IEEE International Conference on Intelligent Sensors, 2015

A high-rate MSR code with polynomial sub-packetization level.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Codes with hierarchical locality.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On partial maximally-recoverable and maximally-recoverable codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Codes With Local Regeneration and Erasure Correction.
IEEE Trans. Inf. Theory, 2014

An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Codes with locality for two erasures.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Optimality of the product-matrix construction for secure MSR regenerating codes.
Proceedings of the 6th International Symposium on Communications, 2014

Evaluation of Codes with Inherent Double Replication for Hadoop.
Proceedings of the 6th USENIX Workshop on Hot Topics in Storage and File Systems, 2014

Message from general chairs.
Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

2013
DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint.
IEEE Trans. Inf. Theory, 2013

Linear Coding Schemes for the Distributed Computation of Subspaces.
IEEE J. Sel. Areas Commun., 2013

High-rate regenerating codes through layering.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Explicit MBR all-symbol locality codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Codes with local regeneration.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On the interior points of the storage-repair bandwidth tradeoff of regenerating codes.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks.
ACM Trans. Sens. Networks, 2012

DMT of Multihop Networks: End Points and Computational Tools.
IEEE Trans. Inf. Theory, 2012

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions.
IEEE Trans. Inf. Theory, 2012

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff.
IEEE Trans. Inf. Theory, 2012

Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, 2012

Regenerating codes for errors and erasures in distributed storage.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Optimal linear codes with a local-error-correction property.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction.
IEEE Trans. Inf. Theory, 2011

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point.
Ad Hoc Networks, 2011

Enabling node repair in any erasure code for distributed storage.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Information-Theoretically Secure Regenerating Codes for Distributed Storage.
Proceedings of the Global Communications Conference, 2011

A nested linear codes approach to distributed function computation over subspaces.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
DMT of Wireless Networks: An Overview (Invited Paper).
J. Commun., 2010

Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
CoRR, 2010

The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment
CoRR, 2010

Regenerating Codes for Distributed Storage Networks.
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

Explicit and optimal codes for distributed storage.
Proceedings of the Information Theory and Applications Workshop, 2010

A flexible class of regenerating codes for distributed storage.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Asymptotic-Information-Lossless Designs and the Diversity-Multiplexing Tradeoff.
IEEE Trans. Inf. Theory, 2009

Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel.
IEEE Trans. Inf. Theory, 2009

D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols.
IEEE Trans. Inf. Theory, 2009

Large Families of Optimal Two-Dimensional Optical Orthogonal Codes
CoRR, 2009

Explicit Codes Minimizing Repair Bandwidth for Distributed Storage
CoRR, 2009

Exact Regenerating Codes for Distributed Storage
CoRR, 2009

Ideal structure of the Silver code.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Low-Correlation Sequences Over the QAM Constellation.
IEEE Trans. Inf. Theory, 2008

DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance
CoRR, 2008

DMT of Multi-hop Cooperative Networks - Part I: Basic Results
CoRR, 2008

Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks
CoRR, 2008

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design
CoRR, 2008

Two New Families of Low-Correlation Interleaved QAM Sequences.
Proceedings of the Sequences and Their Applications, 2008

DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Diversity and degrees of freedom of cooperative wireless networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Low correlation interleaved QAM sequences.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On the Average Case Communication Complexity for Detection in Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2008

2007
A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets.
IEEE Trans. Inf. Theory, 2007

Perfect Space-Time Codes for Any Number of Antennas.
IEEE Trans. Inf. Theory, 2007

Asymptotically optimal cooperative wireless networks with reduced signaling complexity.
IEEE J. Sel. Areas Commun., 2007

Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels
CoRR, 2007

Sequences for Phase-Encoded Optical CDMA.
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007

Low Correlation Sequences over AM-PSK and QAM Alphabets.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff.
IEEE Trans. Inf. Theory, 2006

Low Correlation Sequences over QAM and AM-PSK Constellations
CoRR, 2006

Codes for Optical CDMA.
Proceedings of the Sequences and Their Applications, 2006

Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMA.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

OOCs, Partial Relative Difference Families and a Conjecture of Golomb.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

A Novel Optical CDMA Modulation Scheme: Code Cycle Modulation.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
A unified construction of space-time codes with optimal rate-diversity tradeoff.
IEEE Trans. Inf. Theory, 2005

Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks
CoRR, 2005

Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas
CoRR, 2005

Achieving the DMD tradeoff of the MIMO-ARQ channel.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Improved Johnson bounds for optical orthogonal codes with /spl lambda/ > 1 and some optimal constructions.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Improved constructions and bounds for 2-D optical orthogonal codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
On the input-output weight enumerators of product accumulate codes.
IEEE Commun. Lett., 2004

On orthogonal designs and space-time codes.
IEEE Commun. Lett., 2004

An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z<sub>4</sub>.
Des. Codes Cryptogr., 2004

Topics on Optical Orthogonal Codes.
Proceedings of the Sequences and Their Applications, 2004

New Constructions and Bounds for 2-D Optical Orthogonal Codes.
Proceedings of the Sequences and Their Applications, 2004

Low-density parity-check space-time codes: performance analysis and code construction.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

STBCs with optimal diversity-multiplexing tradeoff for 2, 3 and 4 transmit antennas.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Optimal optical orthogonal codes with lambda > 1.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Optimal constructions of space-time codes over multiple fading blocks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Generalized unified construction of space-time codes with optimal rate-diversity tradeoff.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Low-correlation, large linear span sequences from function fields.
IEEE Trans. Inf. Theory, 2003

Remarks on space-time codes including a new lower bound and an improved code.
IEEE Trans. Inf. Theory, 2003

Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for PSK modulation.
IEEE Trans. Inf. Theory, 2003

3-Designs from the <i>Z</i><sub>4</sub>-Goethals Codes via a New Kloosterman Sum Identity.
Des. Codes Cryptogr., 2003

Algebraic constructions of optimal space-time trellis codes.
Proceedings of the Global Telecommunications Conference, 2003

Constructing optimal space-time codes over various signal constellations.
Proceedings of the Global Telecommunications Conference, 2003

2002
On the performance of space-time codes.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound.
IEEE Trans. Inf. Theory, 2001

Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type.
IEEE Trans. Inf. Theory, 2001

Almost difference sets and their sequences with optimal autocorrelation.
IEEE Trans. Inf. Theory, 2001

On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound.
IEEE Trans. Inf. Theory, 2001

5-Designs from the lifted Golay code over Z<sub>4</sub> via an Assmus-Mattson type approach.
Discret. Math., 2001

A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function.
Des. Codes Cryptogr., 2001

Signal Design for Ultra-wideband Radio.
Proceedings of the Sequences and their Applications, 2001

2000
Quasi-orthogonal sequences for code-division multiple-access systems.
IEEE Trans. Inf. Theory, 2000

On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code.
IEEE Trans. Inf. Theory, 2000

1998
An Infinite Family of 3-Designs from Preparata Codes over Z.
Des. Codes Cryptogr., 1998

Correlation Distribution of the Quaternary Kasami Sequences.
Proceedings of the Sequences and their Applications, 1998

On Ideal Autocorrelation Sequences Arising from Hyperovals.
Proceedings of the Sequences and their Applications, 1998

1997
An Expansion for the Coordinates of the Trace Function over Galois Rings.
Appl. Algebra Eng. Commun. Comput., 1997

1996
On the weight hierarchy of Kerdock codes over Z<sub>4</sub>.
IEEE Trans. Inf. Theory, 1996

Improved binary codes and sequence families from Z<sub>4</sub>-linear codes.
IEEE Trans. Inf. Theory, 1996

Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences.
IEEE Trans. Inf. Theory, 1996

Large families of quaternary sequences with low correlation.
IEEE Trans. Inf. Theory, 1996

Review of 'Algebraic Function Fields and Codes' (Stichtenoth, H.; 1993).
IEEE Trans. Inf. Theory, 1996

Improved estimates via exponential sums for the minimum distance of Z<sub>4</sub>-linear trace codes.
IEEE Trans. Inf. Theory, 1996

Cyclic codes over Z<sub>4</sub>, locator polynomials, and Newton's identities.
IEEE Trans. Inf. Theory, 1996

On the weight hierarchy of the semiprimitive codes.
Discret. Math., 1996

Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes.
Des. Codes Cryptogr., 1996

1995
New constructions of optimal cyclically permutable constant weight codes.
IEEE Trans. Inf. Theory, 1995

An upper bound for Weft exponential sums over Galois tings and applications.
IEEE Trans. Inf. Theory, 1995

The algebraic decoding of the Z<sub>4</sub>-linear Goethals code.
IEEE Trans. Inf. Theory, 1995

The weight hierarchy of the Kasami codes.
Discret. Math., 1995

1994
On the weight hierarchy of geometric Goppa codes.
IEEE Trans. Inf. Theory, 1994

The Z<sub>4</sub>-linearity of Kerdock, Preparata, Goethals, and related codes.
IEEE Trans. Inf. Theory, 1994

Binary sequences with Gold-like correlation but larger linear span.
IEEE Trans. Inf. Theory, 1994

1993
Minimum distance bounds for cyclic codes and Deligne's theorem.
IEEE Trans. Inf. Theory, 1993

A linear construction for certain Kerdock and Preparata codes.
CoRR, 1993

On the Apparent Duality of the Kerdock and Preparata Codes.
Proceedings of the Applied Algebra, 1993

1992
The (d, k) subdoce of a linear block code.
IEEE Trans. Inf. Theory, 1992

Minimum distance of logarithmic and fractional partial m-sequences.
IEEE Trans. Inf. Theory, 1992

4-phase sequences with near-optimum correlation properties.
IEEE Trans. Inf. Theory, 1992

1991
Prime-phase sequences with periodic correlation properties better than binary sequences.
IEEE Trans. Inf. Theory, 1991

1990
On lower bounds to the maximum correlation of complex roots-of-unity sequences.
IEEE Trans. Inf. Theory, 1990

Optical orthogonal codes-New bounds and an optimal construction.
IEEE Trans. Inf. Theory, 1990

1989
A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span.
IEEE Trans. Inf. Theory, 1989

A new general construction for generalized bent functions.
IEEE Trans. Inf. Theory, 1989

1988
On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function.
IEEE Trans. Inf. Theory, 1988

Frequency-hopping code sequence designs having large linear span.
IEEE Trans. Inf. Theory, 1988

1985
Generalized Bent Functions and Their Properties.
J. Comb. Theory, Ser. A, 1985

1984
On bent sequences and generalized bent functions (Ph.D. thesis abstr.).
IEEE Trans. Inf. Theory, 1984

1983
Bounds on the linear span of bent sequences.
IEEE Trans. Inf. Theory, 1983


  Loading...