Victor K. Wei

Available identifiers

zbMath Open wei.victor-k-wMaRDI QIDQ193589

List of research outcomes

Publication	Date of Publication	Type
On the Capacity of Write-Unidirectional Memories With Nonperiodic Codes	2008-12-21	Paper
Information Security	2006-10-20	Paper
Information Security and Privacy	2006-06-22	Paper
Information Security and Cryptology - ICISC 2003	2005-12-27	Paper
Progress in Cryptology - INDOCRYPT 2004	2005-12-22	Paper
Topics in Cryptology – CT-RSA 2005	2005-12-08	Paper
Information Security Practice and Experience	2005-09-13	Paper
Information Security and Privacy	2005-09-07	Paper
On the undetected error probability for binary codes	2005-05-31	Paper
Constructions of permutation arrays	2005-05-11	Paper
On the constructions and nonlinearity of binary vector-output correlation-immune functions	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4428320	2003-09-15	Paper
On the minimum average distance of binary codes: Linear programming approach	2003-08-26	Paper
On equidistant constant weight codes	2003-06-10	Paper
Self-complementary balanced codes and quasi-symmetric designs	2003-04-03	Paper
On the Svanstrom bound for ternary constant-weight codes	2002-08-04	Paper
On the constructions of highly nonlinear zigzag functions and unbiased functions	2002-07-14	Paper
https://portal.mardi4nfdi.de/entity/Q2741409	2001-10-14	Paper
On the depth distribution of linear codes	2001-03-19	Paper
Algebraic-geometry codes	1999-11-21	Paper
An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results	1998-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q4336984	1997-08-26	Paper
The redundancy of source coding with a fidelity criterion. 1. Known statistics	1997-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q4886087	1996-08-22	Paper
Bounds on the sizes of constant weight covering codes	1995-07-20	Paper
On the generalized Hamming weights of product codes	1994-10-03	Paper
Explicit construction of optimal constant-weight codes for identification via channels	1993-05-16	Paper
Minimum distance of logarithmic and fractional partial m-sequences	1992-10-12	Paper
Generalized Hamming weights for linear codes	1992-06-26	Paper
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions	1990-01-01	Paper
Optical orthogonal codes: design, analysis and applications	1989-01-01	Paper
A connection between a convex programming problem and the LYM property on perfect graphs	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3822091	1987-01-01	Paper
Monotone subsequences in (0,1)-matrices	1986-01-01	Paper
Addendum to ``Odd and even Hamming spheres also have minimum boundary	1986-01-01	Paper
Intersection graphs of paths in a tree	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3689221	1986-01-01	Paper
Nonhomogeneous Trellis codes for the Quasi-Synchronous Multiple-Access Binary adder channel with Two Users	1986-01-01	Paper
Cross-monotone subsequences	1985-01-01	Paper
Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes	1985-01-01	Paper
Coding for the binary symmetric broadcast channel with two receivers	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4731197	1985-01-01	Paper
Odd and even Hamming spheres also have minimum boundary	1984-01-01	Paper
Selecting non-consecutive balls arranged in many lines	1984-01-01	Paper
An error-trapping decoder for nonbinary cyclic codes (Corresp.)	1984-01-01	Paper
A partition identity	1983-01-01	Paper
Optimal Sequencing of Items In a Consecutive-2-out-of-n System	1983-01-01	Paper
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel	1983-01-01	Paper
On the characterization of statistically synchronizable codes (Corresp.)	1980-01-01	Paper
Decomposing a Permutation into Two Large Cycles: An Enumeration	1980-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Victor K. Wei