The following pages link to Victor K. Wei (Q193589):
Displayed 50 items.
- Odd and even Hamming spheres also have minimum boundary (Q798656) (← links)
- Selecting non-consecutive balls arranged in many lines (Q802558) (← links)
- (Q1051018) (redirect page) (← links)
- A partition identity (Q1051019) (← links)
- Cross-monotone subsequences (Q1057271) (← links)
- Monotone subsequences in (0,1)-matrices (Q1076026) (← links)
- Addendum to ``Odd and even Hamming spheres also have minimum boundary'' (Q1077417) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- (Q1603458) (redirect page) (← links)
- On the constructions of highly nonlinear zigzag functions and unbiased functions (Q1603459) (← links)
- (Q1804977) (redirect page) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- On equidistant constant weight codes (Q1811100) (← links)
- On the constructions and nonlinearity of binary vector-output correlation-immune functions (Q1827568) (← links)
- Self-complementary balanced codes and quasi-symmetric designs (Q1866020) (← links)
- On the depth distribution of linear codes (Q2705944) (← links)
- (Q2741409) (← links)
- An error-trapping decoder for nonbinary cyclic codes (Corresp.) (Q3329385) (← links)
- On the Capacity of Write-Unidirectional Memories With Nonperiodic Codes (Q3546896) (← links)
- Optimal Sequencing of Items In a Consecutive-2-out-of-n System (Q3661286) (← links)
- Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel (Q3671037) (← links)
- Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes (Q3689074) (← links)
- (Q3689221) (← links)
- Coding for the binary symmetric broadcast channel with two receivers (Q3710456) (← links)
- Nonhomogeneous Trellis codes for the Quasi-Synchronous Multiple-Access Binary adder channel with Two Users (Q3753921) (← links)
- A connection between a convex programming problem and the LYM property on perfect graphs (Q3806997) (← links)
- (Q3822091) (← links)
- Optical orthogonal codes: design, analysis and applications (Q3832473) (← links)
- On the characterization of statistically synchronizable codes (Corresp.) (Q3919603) (← links)
- Decomposing a Permutation into Two Large Cycles: An Enumeration (Q3964571) (← links)
- Generalized Hamming weights for linear codes (Q3980935) (← links)
- Minimum distance of logarithmic and fractional partial m-sequences (Q4014170) (← links)
- Explicit construction of optimal constant-weight codes for identification via channels (Q4034428) (← links)
- On the generalized Hamming weights of product codes (Q4307392) (← links)
- The redundancy of source coding with a fidelity criterion. 1. Known statistics (Q4336285) (← links)
- (Q4336984) (← links)
- (Q4428320) (← links)
- On the Svanstrom bound for ternary constant-weight codes (Q4544648) (← links)
- Constructions of permutation arrays (Q4674484) (← links)
- On the undetected error probability for binary codes (Q4679916) (← links)
- Algebraic-geometry codes (Q4701204) (← links)
- (Q4731197) (← links)
- (Q4886087) (← links)
- An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results (Q4887059) (← links)
- Information Security and Privacy (Q5315269) (← links)
- Information Security Practice and Experience (Q5316510) (← links)
- Information Security and Privacy (Q5473566) (← links)
- Information Security (Q5493165) (← links)
- Topics in Cryptology – CT-RSA 2005 (Q5710840) (← links)
- Progress in Cryptology - INDOCRYPT 2004 (Q5712205) (← links)