The following pages link to P. Vijay Kumar (Q188601):
Displaying 39 items.
- On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound (Q4544599) (← links)
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound (Q4544665) (← links)
- Almost difference sets and their sequences with optimal autocorrelation (Q4544734) (← links)
- Information-Theoretically Secure Erasure Codes for Distributed Storage (Q4566732) (← links)
- (Q4570852) (← links)
- (Q4664645) (← links)
- Low-correlation, large linear span sequences from function fields (Q4680107) (← links)
- (Q4718161) (← links)
- Tight bounds for Chevalley–Warning–Ax–Katz type estimates, with improved applications (Q4812522) (← links)
- On the weight hierarchy of geometric Goppa codes (Q4838646) (← links)
- New constructions of optimal cyclically permutable constant weight codes (Q4838671) (← links)
- An upper bound for Weil exponential sums over Galois rings and applications (Q4838672) (← links)
- Cyclic codes over Z/sub 4/, locator polynomials, and Newton's identities (Q4880003) (← links)
- Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences (Q4880009) (← links)
- The algebraic decoding of the Z/sub 4/-linear Goethals code (Q4880333) (← links)
- Large families of quaternary sequences with low correlation (Q4885687) (← links)
- Improved estimates via exponential sums for the minimum distance of Z/sub 4/-linear trace codes (Q4885721) (← links)
- Improved binary codes and sequence families from Z/sub 4/-linear codes (Q4896844) (← links)
- On the weight hierarchy of Kerdock codes over Z/sub 4/ (Q4896845) (← links)
- (Q4934415) (← links)
- Space–Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel (Q4975918) (← links)
- Codes for Distributed Storage (Q5013057) (← links)
- Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures (Q5124472) (← links)
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures (Q5211651) (← links)
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions (Q5271998) (← links)
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff (Q5272073) (← links)
- DMT of Multihop Networks: End Points and Computational Tools (Q5272107) (← links)
- Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes (Q5272140) (← links)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction (Q5273483) (← links)
- Sequences for Phase-Encoded Optical CDMA (Q5448563) (← links)
- New Constructions and Bounds for 2-D Optical Orthogonal Codes (Q5450845) (← links)
- Topics on Optical Orthogonal Codes (Q5450846) (← links)
- Codes for Distributed Storage (Q5863765) (← links)
- A new family of ternary sequences with ideal two-level autocorrelation function (Q5937083) (← links)
- 5-designs from the lifted Golay code over \(Z_4\) via an Assmus-Mattson type approach (Q5951956) (← links)
- Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound (Q6195684) (← links)
- Small-d MSR codes with optimal access, optimal sub-packetization, and linear field size (Q6574738) (← links)
- Interleaved \(Z_4\)-linear sequences with low correlation for global navigation satellite systems (Q6576122) (← links)
- Explicit rate-optimal streaming codes with smaller field size (Q6576465) (← links)
