The following pages link to Alexander Vardy (Q406566):
Displayed 50 items.
- Nontrivial \(t\)-designs over finite fields exist for all \(t\) (Q406567) (← links)
- Bounds on the dimension of codes and subcodes with prescribed contraction index (Q749512) (← links)
- Optimal tristance anticodes in certain graphs (Q817597) (← links)
- Duality between packings and coverings of the Hamming space (Q874419) (← links)
- A new sphere packing in 20 dimensions (Q1895699) (← links)
- Two new bounds on the size of binary codes with a minimum distance of three (Q1904422) (← links)
- Linearity and complements in projective space (Q1932582) (← links)
- Probabilistic existence of large sets of designs (Q2194761) (← links)
- On \(q\)-analogs of Steiner systems and covering designs (Q2275870) (← links)
- Upper bounds for constant-weight codes (Q2705972) (← links)
- Semantic Security for the Wiretap Channel (Q2914266) (← links)
- (Q2921702) (← links)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
- List Decoding of Polar Codes (Q2978597) (← links)
- Binary Polarization Kernels From Code Decompositions (Q2978599) (← links)
- Generalized Sphere Packing Bound (Q2978607) (← links)
- Codes for Write-Once Memories (Q2989793) (← links)
- Generalized minimum-distance decoding of Euclidean-space codes and lattices (Q3129484) (← links)
- Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis (Q3129485) (← links)
- On the problem of finding zero-concurring codewords (Q3199335) (← links)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes (Q3547075) (← links)
- Coding for the optical channel: the ghost-pulse constraint (Q3547102) (← links)
- Nonlinear dynamics of iterative decoding systems: analysis and applications (Q3547141) (← links)
- The structure of tail-biting trellises: Minimality and basic principles (Q3547142) (← links)
- Algebraic soft-decision decoding of reed-solomon codes (Q3547143) (← links)
- On the stopping distance and the stopping redundancy of codes (Q3547600) (← links)
- Improved Probabilistic Bounds on Stopping Redundancy (Q3604449) (← links)
- Bit-level soft-decision decoding of Reed-Solomon codes (Q3985162) (← links)
- Density doubling, double-circulants, and new sphere packings (Q4216320) (← links)
- (Q4242031) (← links)
- (Q4279531) (← links)
- Maximum likelihood decoding of the Leech lattice (Q4307354) (← links)
- Maximum-likelihood soft decision decoding of BCH codes (Q4308800) (← links)
- The Nordstrom-Robinson code: representation over GF(4) and efficient decoding (Q4324157) (← links)
- The uniqueness of the Best code (Q4324158) (← links)
- The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions (Q4324165) (← links)
- Joint equalization and coding for intersymbol interference channels (Q4339606) (← links)
- Upper bounds on trellis complexity of lattices (Q4345634) (← links)
- On Perfect Codes and Tilings: Problems and Solutions (Q4388989) (← links)
- The intractability of computing the minimum distance of a code (Q4392377) (← links)
- Interleaving schemes for multidimensional cluster errors (Q4400285) (← links)
- Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist (Q4443095) (← links)
- Which codes have cycle-free Tanner graphs? (Q4503390) (← links)
- Generalized minimum distance decoding in Euclidean space: performance analysis (Q4503500) (← links)
- (Q4526974) (← links)
- (Q4535935) (← links)
- The turbo decoding algorithm and its phase trajectories (Q4544515) (← links)
- Signal-space characterization of iterative decoding (Q4544519) (← links)
- A table of upper bounds for binary codes (Q4544744) (← links)