The following pages link to Alexander Barg (Q224923):
Displaying 50 items.
- Linear codes on posets with extension property (Q393354) (← links)
- (Q415645) (redirect page) (← links)
- Spectral approach to linear programming bounds on codes (Q415647) (← links)
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes (Q517737) (← links)
- Interactive function computation via polar coding (Q522930) (← links)
- The matroid of supports of a linear code (Q677565) (← links)
- A bound on Grassmannian codes (Q855863) (← links)
- Codes in spherical caps (Q874424) (← links)
- Weight distribution and decoding of codes on hypergraphs (Q1001643) (← links)
- Concatenated decoding algorithm with incomplete inspection of code vectors (Q1090662) (← links)
- Algebro-geometric codes on curves of small genera (Q1098822) (← links)
- At the dawn of the theory of codes (Q1209799) (← links)
- (Q1299904) (redirect page) (← links)
- Binomial moments of the distance distribution and the probability of undetected error. (Q1299906) (← links)
- A large family of sequences with low periodic correlation (Q1377675) (← links)
- Locally recoverable codes from algebraic curves and surfaces (Q1742159) (← links)
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization (Q1802188) (← links)
- A class of I.P.P. codes with efficient identification (Q1827562) (← links)
- Bounds on the covering radius of linear codes (Q1866019) (← links)
- Two families of low-correlated binary sequences (Q1925010) (← links)
- Strengthening the Gilbert-Varshamov bound (Q1973922) (← links)
- Polar codes for distributed hierarchical source coding (Q2018431) (← links)
- Bounds for discrepancies in the Hamming space (Q2041065) (← links)
- A construction of maximally recoverable codes (Q2119945) (← links)
- Optimal locally private estimation under \(\ell_p\) loss for \(1\le p\le 2\) (Q2326993) (← links)
- Finite two-distance tight frames (Q2347359) (← links)
- Association schemes on general measure spaces and zero-dimensional abelian groups (Q2354365) (← links)
- Bounds on sets with few distances (Q2431616) (← links)
- Bounds for the sum of distances of spherical sets of small size (Q2689513) (← links)
- A new upper bound on the reliability function of the Gaussian channel (Q2705925) (← links)
- (Q2717190) (← links)
- (Q2717212) (← links)
- (Q2741388) (← links)
- (Q2741389) (← links)
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents (Q2753534) (← links)
- On Some Polynomials Related to Weight Enumerators of Linear Codes (Q2784509) (← links)
- (Q2802994) (← links)
- Bounds on the Parameters of Locally Recoverable Codes (Q2976756) (← links)
- Restricted Isometry Property of Random Subdictionaries (Q2977352) (← links)
- A Family of Optimal Locally Recoverable Codes (Q2986212) (← links)
- Polar Codes for $q$-Ary Channels, $q=2^{r}$ (Q2989415) (← links)
- Robust Parent-Identifying Codes and Combinatorial Arrays (Q2989419) (← links)
- Constructions of Rank Modulation Codes (Q2989421) (← links)
- Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component (Q2989660) (← links)
- (Q3000904) (← links)
- Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption (Q3002115) (← links)
- DC-constrained codes from Hadamard matrices (Q3356227) (← links)
- Multilevel expander codes (Q3374403) (← links)
- New bounds for equiangular lines (Q3464535) (← links)
- STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES (Q6072670) (← links)
