research
          
      
      ∙
      07/16/2021
    Linear Programming Bounds for Almost-Balanced Binary Codes
We revisit the linear programming bounds for the size vs. distance trade...
          
            research
          
      
      ∙
      09/11/2020
    Linear Shannon Capacity of Cayley Graphs
The Shannon capacity of a graph is a fundamental quantity in zero-error ...
          
            research
          
      
      ∙
      11/10/2019
    Arıkan meets Shannon: Polar codes with near-optimal convergence to channel capacity
Let W be a binary-input memoryless symmetric (BMS) channel with Shannon ...
          
            research
          
      
      ∙
      05/10/2018
    Beating Fredman-Komlós for perfect k-hashing
We say a subset C ⊆{1,2,...,k}^n is a k-hash code (also called k-separat...
          
            research
          
      
      ∙
      10/20/2017
     
             
  
  
     
                             
                             share
 share