The following pages link to N. Kashyap (Q1752292):
Displaying 31 items.
- Some ``good'' properties of LDA lattices (Q1752293) (← links)
- On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model (Q2976693) (← links)
- The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint (Q2977030) (← links)
- Secure Compute-and-Forward in a Bidirectional Relay (Q2978624) (← links)
- Upper Bounds on the Size of Grain-Correcting Codes (Q2986214) (← links)
- Periodic prefix-synchronized codes: A generating function approach (Q3547099) (← links)
- Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity (Q3547100) (← links)
- Coding for the optical channel: the ghost-pulse constraint (Q3547102) (← links)
- A Comparative Study of Periods in a Periodic-Finite-Type Shift (Q3583322) (← links)
- A Decomposition Theory for Binary Linear Codes (Q3604516) (← links)
- Matroid Pathwidth and Code Trellis Complexity (Q3614205) (← links)
- The Effect of Malformed Tiles on Tile Assemblies within kTAM (Q3654674) (← links)
- Equalities among Capacities of (<i>d</i>,<i>k</i>)-Constrained Systems (Q4443138) (← links)
- Maximizing the Shannon Capacity of Constrained Systems with Two Constraints (Q4443139) (← links)
- Data synchronization with timing (Q4544578) (← links)
- On quantization with the Weaire-Phelan partition (Q4544689) (← links)
- On the Optimality of Secret Key Agreement via Omniscience (Q4569189) (← links)
- Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint (Q4682814) (← links)
- Computable Upper Bounds on the Capacity of Finite-State Channels (Q4958258) (← links)
- Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs (Q4974044) (← links)
- Data Synchronization With Timing: The Variable-Rate Case (Q4975671) (← links)
- On Minimal Tree Realizations of Linear Codes (Q4975950) (← links)
- How many modes can a mixture of Gaussians with uniformly bounded means have? (Q5095256) (← links)
- Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources (Q5224132) (← links)
- The Treewidth of MDS and Reed–Muller Codes (Q5271845) (← links)
- Coding for High-Density Recording on a 1-D Granular Magnetic Medium (Q5272241) (← links)
- (Q5301308) (← links)
- Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation (Q5346543) (← links)
- The “Art of Trellis Decoding” Is NP-Hard (Q5386095) (← links)
- An Application of Ramsey Theory to Coding for the Optical Channel (Q5470801) (← links)
- How Many Modes Can a Mixture of Gaussians with Uniformly Bounded Means Have? (Q6339991) (← links)
