The following pages link to Yair Be'ery (Q749511):
Displaying 30 items.
- Bounds on the dimension of codes and subcodes with prescribed contraction index (Q749512) (← links)
- Convergence analysis of turbo decoding of serially concatenated block codes and product codes (Q2570496) (← links)
- The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes (Q3129469) (← links)
- On the problem of finding zero-concurring codewords (Q3199335) (← links)
- A Note on Nonlinear Xing Codes (Q3547620) (← links)
- Lower Bounds on the State Complexity of Linear Tail-Biting Trellises (Q3547622) (← links)
- Optimal soft decision block decoders based on fast Hadamard transform (Q3726009) (← links)
- A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm (Q3786396) (← links)
- Bit-level soft-decision decoding of Reed-Solomon codes (Q3985162) (← links)
- Bounds on the trellis size of linear block codes (Q4034451) (← links)
- Maximum likelihood decoding of the Leech lattice (Q4307354) (← links)
- Maximum-likelihood soft decision decoding of BCH codes (Q4308800) (← links)
- The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions (Q4324165) (← links)
- Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code (Q4330273) (← links)
- Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes (Q4400274) (← links)
- Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes (Q4501736) (← links)
- Bounds on the state complexity of codes from the Hermitian function field and its subfields (Q4503621) (← links)
- Convergence analysis of turbo decoding of product codes (Q4544516) (← links)
- Reed-Muller codes: projections onto GF(4) and multilevel construction (Q4544697) (← links)
- On the trellis representation of the Delsarte-Goethals codes (Q4701125) (← links)
- Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors (Q4701231) (← links)
- Generalized Hamming weights of nonlinear codes and the relation to the Z/sub 4/-linear representation (Q4701321) (← links)
- Geometrical and performance analysis of GMD and Chase decoding algorithms (Q4701402) (← links)
- The weighted coordinates bound and trellis complexity of block codes and periodic packings (Q4701429) (← links)
- The Preparata and Goethals codes: trellis complexity and twisted squaring constructions (Q4701430) (← links)
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes (Q4733828) (← links)
- Soft trellis-based decoder for linear block codes (Q4838631) (← links)
- Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes (Q4857528) (← links)
- (Q4954428) (← links)
- Concatenated multilevel block coded modulation (Q5288599) (← links)
