The following pages link to Alexander Barg (Q224923):
Displaying 50 items.
- Distance Distribution of Binary Codes and the Error Probability of Decoding (Q3546534) (← links)
- Correction to “Bounds on Packings of Spheres in the Grassmann Manifold” (Q3546535) (← links)
- Concatenated Codes: Serial and Parallel (Q3546536) (← links)
- Distance properties of expander codes (Q3546537) (← links)
- On the Fingerprinting Capacity Under the Marking Assumption (Q3604735) (← links)
- Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes (Q3604940) (← links)
- A Functional View of Upper Bounds on Codes (Q3614593) (← links)
- Bounds on ordered codes and orthogonal arrays (Q3649464) (← links)
- (Q3735627) (← links)
- (Q3792621) (← links)
- On computing the weight spectrum of cyclic codes (Q4014158) (← links)
- (Q4242014) (← links)
- (Q4432453) (← links)
- (Q4470455) (← links)
- Linear-time binary codes correcting localized erasures (Q4503458) (← links)
- Quantum error detection .II. Bounds (Q4503582) (← links)
- Quantum error detection .I. Statement of the problem (Q4503583) (← links)
- Concatenated codes with fixed inner code and random outer code (Q4544479) (← links)
- Estimates of the distance distribution of codes and designs (Q4544541) (← links)
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization (Q4566493) (← links)
- Group Testing Schemes From Codes and Designs (Q4566548) (← links)
- Construction of Polar Codes for Arbitrary Discrete Memoryless Channels (Q4566635) (← links)
- A broadcast key distribution scheme based on block designs (Q4608491) (← links)
- Minimal supports in linear codes (Q4608492) (← links)
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters (Q4629923) (← links)
- Error Exponents of Expander Codes under Linear-Complexity Decoding (Q4652601) (← links)
- (Q4664654) (← links)
- Error exponents of expander codes (Q4674540) (← links)
- Bounds on packings of spheres in the Grassmann manifold (Q4677566) (← links)
- Random codes: minimum distances and error exponents (Q4677576) (← links)
- A low-rate bound on the reliability of a quantum discrete memoryless channel (Q4677629) (← links)
- Digital fingerprinting codes: problem statements, constructions, identification of traitors (Q4680056) (← links)
- Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy (Q4682868) (← links)
- Minimal vectors in linear codes (Q4701180) (← links)
- Binomial moments of the distance distribution: bounds and applications (Q4701293) (← links)
- New upper bounds on generalized weights (Q4701380) (← links)
- On the complexity of minimum distance decoding of long linear codes (Q4701401) (← links)
- (Q4886128) (← links)
- (Q4945066) (← links)
- Cyclic and Convolutional Codes With Locality (Q4963927) (← links)
- Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein” (Q5001709) (← links)
- Node Repair on Connected Graphs (Q5088447) (← links)
- Recoverable Systems (Q5088498) (← links)
- Error Correction Based on Partial Information (Q5123793) (← links)
- Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes (Q5138906) (← links)
- Capacity of Dynamical Storage Systems (Q5151713) (← links)
- Codes With Hierarchical Locality From Covering Maps of Curves (Q5211427) (← links)
- Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model (Q5211640) (← links)
- The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size (Q5223961) (← links)
- Coding for High-Density Recording on a 1-D Granular Magnetic Medium (Q5272241) (← links)
