Certain results in coding theory for compound channels,
Proc. Colloquium Inf. Th. Debrecen (Hungary), 35-60.
[pdf]
1968
[2]
Beiträge zur Shannonschen Informationstheorie im Fall
nichtstationärer Kanäle,
Z. Wahrscheinlichkeitstheorie und verw. Geb. 10, 1-42.
[pdf]
[3]
The weak capacity of averaged channels,
Z. Wahrscheinlichkeitstheorie und verw. Geb. 11, 61-73.
[pdf]
1969
[4]
Correlated decoding for channels with arbitrarily varying channel
probability functions,
(with J. Wolfowitz),
Information and Control 14, 457-473.
[pdf]
[5]
The structure of capacity functions for compound channels,
(with J. Wolfowitz),
Proc. of the Internat. Symposium on Probability and Information
Theory at McMaster University, Canada, April 1968, 12-54.
[pdf]
1970
[6]
The capacity of a channel with arbitrarily varying channel
probability functions and binary output alphabet,
(with J. Wolfowitz),
Z. Wahrscheinlichkeitstheorie und verw. Geb. 15, 186-194.
[pdf]
[7]
A note on the existence of the weak capacity for channels with
arbitrarily varying channel probability functions and its relation
to Shannon's zero error capacity,
Ann. Math. Stat., Vol. 41, No. 3, 1027-1033.
[pdf]
1971
[8]
Channels without synchronization,
(with J. Wolfowitz),
Advances in Applied Probability, Vol. 3, 383-403.
[pdf]
[9]
Group codes do not achieve Shannon's channel capacity for general
discrete channels,
Ann. Math. Stat., Vol. 42, No. 1, 224-240.
[pdf]
[10]
Bounds on algebraic code capacities for noisy channels I,
(with J. Gemma),
Information and Control, Vol. 19, No. 2, 124-145.
[pdf]
[11]
Bounds on algebraic code capacities for noisy channels II,
(with J. Gemma),
Information and Control, Vol. 19, No. 2, 146-158.
[pdf]
1973
[12]
Multi-way communication channels,
Proceedings of 2nd International Symposium on Information Theory,
Thakadsor, Armenian SSR, Sept. 1971, Akademiai Kiado, Budapest, 23-52.
[pdf]
[13]
On two-way communication channels and a problem by Zarankiewicz,
Sixth Prague Conf. on Inf. Th., Stat. Dec. Fct's and Rand. Proc.,
Sept. 1971, Publ. House Chechosl. Academy of Sc., 23-37.
[pdf]
[14]
A constructive proof of the coding theorem for discrete memoryless
channels in case of complete feedback,
Sixth Prague Conf. on Inf. Th., Stat. Dec. Fct's and
Rand. Proc., Sept. 1971, Publ. House Czechosl. Academy of Sc., 1-22.
[pdf]
[15]
The capacity of a channel with arbitrarily varying additive Gaussian
channel probability functions,
Sixth Prague Conf. on Inf. Th., Stat. Dec. Fct's and
Rand. Proc., Sept. 1971, Publ. House Czechosl. Academy of Sc., 39-50.
[pdf]
[16]
Channels with arbitrarily varying channel probability functions
in the presence of noiseless feedback,
Z. Wahrscheinlichkeitstheorie und verw. Geb. 25, 239-252.
[pdf]
[17]
Channel capacities for list codes,
J. Appl. Probability, lo, 824-836.
[pdf]
1974
[18]
The capacity region of a channel with two senders and two receivers,
Ann. Probability, Vol. 2, No. 5, 805-814.
[pdf]
[19]
On common information and related characteristics of correlated
information sources,
(with J. Körner),
presented at the 7th Prague Conf. on Inf. Th., Stat. Dec. Fct's and
Rand. Proc., included in ``Information Theory''
by I. Csiszár and J. Körner, Acad. Press, 1981,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 2006, 664-677.
[pdf]
1975
[20]
Approximation of continuous functions in p-adic analysis,
(with R. Bojanic),
J. Approximation Theory, Vol. 15, No. 3, 190-205.
[pdf]
[21]
Source coding with side information and a converse for degraded
broadcast channels,
(with J. Körner),
IEEE Trans. Inf. Theory, Vol. IT-21, No. 6, 629-637.
[pdf]
[22]
Two contributions to information theory,
(with P. Gács),
Colloquia Mathematica Societatis János Bolyai, 16. Topics in Information
Theory, I. Csiszár and P. Elias Edit., Keszthely, Hungaria, 1975, 17-40.
[pdf]
1976
[23]
Bounds on conditional probabilities with applications in multiuser
communication,
(with P. Gács and J. Körner),
Z. Wahrscheinlichkeitstheorie und verw. Geb. 34, 157-177.
[pdf]
[24]
Every bad code has a good subcode: a local converse to the coding
theorem,
(with G. Dueck),
Z. Wahrscheinlichkeitstheorie und verw. Geb. 34, 179-182.
[pdf]
[25]
Spreading of sets in product spaces and hypercontraction of the Markov
operator,
(with P. Gács),
Ann. Prob., Vol. 4, No. 6, 925-939.
[pdf]
1977
[26]
On the connection between the entropies of input and output
distributions of discrete memoryless channels,
(with J. Körner),
Proceedings of the 5th Conference on Probability Theory, Brasov 1974,
Editura Academeiei Rep. Soc. Romania, Bucaresti 1977, 13-23.
[pdf]
[27]
Contributions to the geometry of Hamming spaces,
(with G. Katona),
Discrete Mathematics 17, 1-22.
[pdf]
[28]
The number of values of combinatorial functions,
(with D.E. Daykin),
Bull. London Math. Soc., 11, 49-51.
[pdf]
1978
[29]
Elimination of correlation in random codes for arbitrarily varying
channels,
Z. Wahrscheinlichkeitstheorie und verw. Geb. 44, 159-175.
[pdf]
[30]
An inequality for the weights of two families of sets, their
unions and intersections,
(with D.E. Daykin),
Z. Wahrscheinlichkeitstheorie und verw. Geb. 43, 183-185.
[pdf]
[31]
Graphs with maximal number of adjacent pairs of edges,
(with G. Katona),
Acta Math. Acad. Sc. Hung. 32, 97-120.
[pdf]
1979
[32]
Suchprobleme,
(with I. Wegener),
Teubner Verlag, Stuttgart,
Russian Edition with Appendix by Maljutov 1981 (Book).
[pdf]
[33]
Inequalities for a pair of maps
with
a finite set,
(with D.E. Daykin),
Math. Zeitschrift 165, 267-289.
[pdf]
[34]
Integral inequalities for increasing functions,
(with D.E. Daykin),
Math. Proc. Camb. Phil. Soc., 86, 391-394.
[pdf]
[35]
Coloring hypergraphs: A new approach to multi-user source coding I,
Journ. of Combinatorics, Information and System Sciences, Vol. 4,
No. 1, 76-115.
[pdf]
1980
[36]
Coloring hypergraphs: A new approach to multi-user source coding II,
Journ. of Combinatorics, Information and System Sciences, Vol. 5,
No. 3, 220-268.
[pdf]
[37]
Simple hypergraphs with maximal number of adjacent pairs of edges,
J. Comb. Theory, Ser. B, Vol. 28, No. 2, 164-167.
[pdf]
[38]
A method of coding and its application to arbitrarily varying channels,
J. Combinatorics, Information and System Sciences, Vol. 5, No. 1, 10-35.
[pdf]
1981
[39]
To get a bit of information may be as hard as to get full information,
(with I. Csiszár),
IEEE Trans. Inf. Theory, IT-27, No. 4, 398-408.
[pdf]
[40]
Solution of Burnashev's problem and a sharpening of Erdos-Ko-Rado,
Siam Review, to appear in a book by G. Katona.
Recently included in
General Theory of Information Transfer and Combinatorics, Report on a
Research Project at the ZIF (Center of interdisciplinary studies) in
Bielefeld Oct. 1, 2001 - August 31, 2004, edited by R. Ahlswede with the
assistance of L. Bäumer and N. Cai.
[pdf]
1982
[41]
Remarks on Shannon's secrecy systems,
Probl. of Control and Inf. Theory, Vol. 11, No. 4, 301-318.
[pdf]
[42]
Bad Codes are good ciphers,
(with G. Dueck),
Probl. of Control and Inf. Theory, Vol. 11, No. 5, 337-351.
[pdf]
[43]
Good codes can be produced by a few permutations,
(with G. Dueck),
IEEE Trans. Inf. Theory, IT-28, No. 3, 430-443.
[pdf]
[44]
An elementary proof of the strong converse theorem for the
multiple-access channel,
J. Combinatorics, Information and System Sciences, Vol. 7,
No. 3, 216-230.
[pdf]
Note on an extremal problem arising for unreliable networks
in parallel computing,
(with K.U. Koschnick),
Discrete Mathematics 47, 137-152.
[pdf]
[47]
On source coding with side information via a multiple-access channel
and related problems in multi-user information theory,
(with T.S. Han),
IEEE Trans. Inf. Theory, Vol. IT-29, No. 3, 396-412.
[pdf]
1984
[48]
A two family extremal problem in Hamming space,
(with A. El Gamal and K.F. Pang),
Discrete mathematics 49, 1-5.
[pdf]
[49]
Improvements of Winograd's Result on Computation in the Presence
of Noise,
IEEE Trans. Inf. Theory, Vol. IT-30, No. 6, 872-877.
[pdf]
1985
[50]
The rate-distortion region for multiple descriptions without
excess rate,
IEEE Trans. Inf. Theory, Vol. IT-31, No. 6, 721-726.
[pdf]
1986
[51]
Hypothesis testing under communication constraints,
(with I. Csiszár),
IEEE Trans. Inf. Theory, Vol. IT-32, No. 4, 533-543.
[pdf]
[52]
On multiple description and team guessing,
IEEE Trans. Inf. Theory, Vol. IT-32, No. 4, 543-549.
[pdf]
[53]
Arbitrarily varying channels with states sequence known to the sender,
invited paper at a Statistical Research Conference dedicated to
the memory of Jack Kiefer and Jacob Wolfowitz,
held at Cornell University, July 1983,
IEEE Trans. Inf. Theory, Vol. IT-32, No. 5, 621-629.
[pdf]
1987
[54]
Optimal coding strategies for certain permuting channels,
(with A. Kaspi),
IEEE Trans. Inf. Theory, Vol. IT-33, No. 3, 310-314.
[pdf]
[55]
Search Problems,
(with I. Wegener),
English Edition of [32] with Supplement of recent Literature,
R.L. Graham, J.K. Leenstra, R.E. Tarjan (Ed.),
Wiley-Interscience Series in Discrete Mathematics and Optimization.
[pdf] (Preface and Content)
[56]
Inequalities for code pairs,
(with M. Moers),
European J. of Combinatorics 9, 175-181.
[pdf]
[57]
Eight problems in information theory
-- a complexity problem
-- codes as orbits
Contributions to ``Open Problems in Communication and Computation'',
T.M. Cover and B. Gopinath (Ed.), Springer-Verlag.
[pdf]
[58]
On code pairs with specified Hamming distances,
Colloquia Mathematica Societatis János Bolyai 52, Combinatorics,
Eger (Hungary), 9-47.
[pdf]
1989
[59]
Identification via channels,
(with G. Dueck),
IEEE Trans. Inf. Theory, Vol. 35, No. 1, 15-29.
[pdf]
[60]
Identification in the presence of feedback -- a discovery of new
capacity formulas,
(with G. Dueck),
IEEE Trans. Inf. Theory, Vol. 35, No. 1, 30-39.
[pdf]
[61]
Contributions to a theory of ordering for sequence spaces,
(with Z. Zhang),
Problems of Control and Information Theory, Vol. 18, No. 4, 197-221.
[pdf]
[62]
A general 4-words inequality with consequences for 2-way
communication complexity,
(with N. Cai and Z. Zhang),
Advances in Applied Mathematics, Vol. 10, 75-94.
[pdf]
1990
[63]
Coding for write-efficient memory,
(with Z. Zhang),
Information and Computation, Vol. 83, No. 1, 80-97.
[pdf]
[64]
Creating order in sequence spaces with simple machines,
(with Jian-ping Ye and Z. Zhang),
Information and Computation, Vol. 89, No. 1, 47-94.
[pdf]
[65]
An identity in combinatorial extremal theory,
(with Z. Zhang),
Adv. in Math., Vol. 80, No. 2, 137-151.
[pdf]
[66]
On minimax estimation in the presence of side information about
remote data,
(with M.V. Burnashev),
Ann. of Stat., Vol. 18, No. 1, 141-171.
[pdf]
A recursive bound for the number of complete K-subgraphs of a graph,
(with N. Cai and Z. Zhang),
``Topics in graph theory and combinatorics''
in honour of G. Ringel on the occasion of his 70th birthday,
R. Bodendiek, R. Henn (Eds), 37-39.
[pdf]
[69]
On cloud-antichains and related configurations,
(with Z. Zhang),
Discrete Mathematics 85, 225-245.
[pdf]
1991
[70]
Reusable memories in the light of the old AV- and new OV-channel
theory,
(with G. Simonyi),
IEEE Trans. Inf. Theory, Vol. 37, No. 4, 1143-1150.
[pdf]
[71]
On identification via multi-way channels with feedback,
(with B. Verboven),
IEEE Trans. Inf. Theory, Vol. 37, No. 5, 1519-1526.
[pdf]
[72]
Two proofs of Pinsker's conjecture concerning AV channels,
(with N. Cai),
IEEE Trans. Inf. Theory, Vol. 37, No. 6, 1647-1649.
[pdf]
1992
[73]
Diametric theorems in sequence spaces,
(with N. Cai and Z. Zhang),
Combinatorica, Vol. 12, No. 1, 1-17.
[pdf]
[74]
On set coverings in Cartesian product spaces,
General Theory of Information Transfer and Combinatorics,
Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 2006, 926-937.
[pdf]
[75]
Rich colorings with local constraints,
(with N. Cai and Z. Zhang),
J. Combinatorics, Information & System Sciences,
Vol. 17, Nos. 3-4, 203-216.
[pdf]
1993
[76]
Asymptotically dense nonbinary codes correcting a constant
number of localized errors,
(with L.A. Bassalygo and M.S. Pinsker),
Proc. III International workshop ``Algebraic and
Combinatorial Coding Theory'', June 22-28, 1992, Tyrnovo, Bulgaria,
Comptes rendus de l' Académie bulgare des Sciences,
Tome 46, No. 1, 35-37.
[pdf]
[77]
The maximal error capacity of AV channels for constant list sizes,
IEEE Trans. Inf. Theory, Vol. 39, No. 4, 1416-1417.
[pdf]
Common randomness in information theory and cryptography,
Part I: Secret sharing,
(with I. Csiszár),
IEEE Trans. Inf. Theory, Vol. 39, No. 4, 1121-1132.
[pdf]
[80]
A generalization of the AZ identity,
(with N. Cai),
Combinatorica 13 (3), 241-247.
[pdf]
[81]
On partitioning the n-cube into sets with mutual distance 1,
(with S.L. Bezrukov, A. Blokhuis, K. Metsch, and G.E. Moorhouse),
Applied Math. Lett., Vol. 6, No. 4, 17-19.
[pdf]
[82]
Communication complexity in lattices,
(with N. Cai and U. Tamm),
Applied Math. Lett., Vol. 6, No. 6, 53-58.
[pdf]
[83]
Rank formulas for certain products of matrices,
(with N. Cai),
Applicable Algebra in Engineering, Communication and Computing, 2, 1-9.
[pdf]
[84]
On extremal set partitions in Cartesian product spaces,
(with N. Cai),
Combinatorics, Probability & Computing 2, 211-220.
[pdf]
1994
[85]
Note on the optimal structure of recovering set pairs in
lattices: the sandglass conjecture,
(with G. Simonyi),
Discrete Math., 128, 389-394.
[pdf]
[86]
On extremal sets without coprimes,
(with L.H. Khachatrian),
Acta Arithmetica, LXVI 1, 89-99.
[pdf]
[87]
The maximal length of cloud-antichains,
(with L.H. Khachatrian),
Discrete Mathematics, Vol. 131, 9-15.
[pdf]
[88]
The asymptotic behaviour of diameters in the average,
(with I. Althöfer),
J. Combinatorial Theory, Series B, Vol. 61, No. 2, 167-177.
[pdf]
[89]
2-way communication complexity of sum-type functions for
one processor to be informed,
(with N. Cai),
Problemy Peredachi Informatsii, Vol. 30, No. 1, 3-12.
[pdf]
[90]
Messy broadcasting in networks,
(with H.S. Haroutunian and L.H. Khachatrian),
Special volume in honour of J.L. Massey on occasion of his 60th birthday.
Communications and Cryptography (Two sides of one tapestry),
R.E. Blahut, D.J. Costello, U. Maurer, T. Mittelholzer (Ed.),
Kluwer Acad. Publ., 13-24.
[pdf]
[91]
Binary constant weight codes correcting localized errors and defects,
(with L.A. Bassalygo and M.S. Pinsker),
Probl. Peredachi Informatsii, Vol. 30, No. 2, 10-13 (In Russian);
Probl. of Inf. Transmission, 102-104.
[pdf]
[92]
On sets of words with pairwise common letter in different positions,
(with N. Cai),
Proc. Colloquium on Extremal Problems for Finite Sets, Visograd,
Bolyai Siciety Math. Studies, 3, Hungary, 25-38.
[pdf]
[93]
On multi-user write-efficient memories,
(with Z. Zhang),
IEEE Trans. Inf. Theory, Vol. 40, No. 3, 674-686.
[pdf]
[94]
On communication complexity of vector-valued functions,
(with N. Cai),
IEEE Trans. Inf. Theory, Vol. 40, No. 6, 2062-2067.
[pdf]
[95]
On partitioning and packing products with rectangles,
(with N. Cai),
Combinatorics, Probability & Computing 3, 429-434.
[pdf]
[96]
A new direction in extremal theory,
(with N. Cai and Z. Zhang),
J. Combinatorics, Information & System Sciences, Vol. 19, No. 3-4,
269-280.
[pdf]
[97]
Asymptotically optimal binary codes of polynomial complexity
correcting localized errors,
(with L.A. Bassalygo and M.S. Pinsker),
Proc. IV International workshop on Algebraic and Combinatorial Coding
Theory, Novgorod, Russia, 1-3.
[pdf]
1995
[98]
Localized random and arbitrary errors in the light of AV channel theory,
(with L.A. Bassalygo and M.S. Pinsker),
IEEE Trans. Inf. Theory, Vol. 41, No. 1, 14-25.
[pdf]
[99]
Edge isoperimetric theorems for integer point arrays,
(with S.L. Bezrukov),
Applied Math. Letters, Vol. 8, No. 2, 75-80.
[pdf]
[100]
New directions in the theory of identification via channels,
(with Z. Zhang),
IEEE Trans. Inf. Theory, Vol. 41, No. 4, 1040-1050.
[pdf]
[101]
Towards characterising equality in correlation inequalities,
(with L.H. Khachatrian),
European J. of Combinatorics 16, 315-328.
[pdf]
[102]
Maximal sets of numbers not containing pairwise coprime
integers,
(with L.H. Khachatrian),
Acta Arithmetica LXX II, 1, 77-100.
[pdf]
[103]
Density inequalities for sets of multiples,
(with L.H. Khachatrian),
J. of Number Theory, Vol. 55, No. 2.,
170-180.
[pdf]
[104]
A splitting property of maximal antichains,
(with P.L. Erdos and N. Graham),
Combinatorica 15 (4), 475-480.
[pdf]
1996
[105]
Sets of integers and quasi-integers with pairwise common divisor,
(with L.H. Khachatrian),
Acta Arithmetica, LXXIV.2, 141-153.
[pdf]
[106]
A counterexample to Aharoni's ``Strongly maximal matching''
conjecture,
(with L.H. Khachatrian),
Discrete Mathematics 149, 289.
[pdf]
[107]
Erasure, list, and detection zero-error capacities for low noise and a
relation to identification,
(with N. Cai and Z. Zhang),
IEEE Trans. Inf. Theory, Vol. 42, No. 1, 55-62.
[pdf]
[108]
Optimal pairs of incomparable clouds in multisets,
(with L.H. Khachatrian),
Graphs and Combinatorics 12, 97-137.
[pdf]
[109]
Sets of integers with pairwise common divisor and a factor from a
specified set of primes,
(with L.H. Khachatrian),
Acta Arithmetica LXX V 3, 259-276.
[pdf]
[110]
Cross-disjoint pairs of clouds in the interval lattice,
(with N. Cai),
The Mathematics of Paul Erdos, Vol. I; R.L. Graham and J. Nesetril, ed.,
Algorithms and Combinatorics B, Springer Verlag, Berlin/Heidelberg/New
York, 155-164.
[pdf]
[111]
Identification under random processes,
(with V. Balakirsky),
Problemy peredachii informatsii (special issue devoted to M.S. Pinsker),
vol. 32, no. 1, 144-160, Jan.-March 1996;
Problems of Information Transmission, Vol. 32, No. 1, 123-138.
[pdf]
[112]
Report on work in progress in combinatorial extremal theory:
Shadows, AZ-identity, matching.
Ergänzungsreihe des SFB 343
``Diskrete Strukturen in der Mathematik'', Universität Bielefeld,
Nr. 95-004.
[html]
[113]
Fault-tolerant minimum broadcast networks,
(with L. Gargano, H.S. Haroutunian, and L.H. Khachatrian),
Networks, Vol. 27, No. 4, 1293-1307.
[pdf]
[114]
The complete nontrivial-intersection theorem for systems of finite sets,
(with L.H. Khachatrian),
J. Combinatorial Theory, Series A, 121-138.
[pdf]
[115]
Incomparability and intersection properties of Boolean interval
lattices and chain posets,
(with N. Cai),
European J. of Combinatorics 17, 677-687.
[pdf]
[116]
Classical results on primitive and recent results on cross-primitive
sequences,
(with L.H. Khachatrian),
The Mathematics of P. Erdos, Vol. I; R.L. Graham and J. Nesetril, ed.,
Algorithms and Combinatorics B, Springer Verlag, Berlin/Heidelberg/ New
York, 104-116.
[pdf]
[117]
Intersecting Systems,
(with N. Alon, P.L. Erdos, M. Ruszinko, L.A. Székely),
Combinatorics, Probability and Computing 6, 127-137.
[pdf]
[118]
Some properties of fix-free codes,
(with B. Balkenhol and L.H. Khachatrian),
Proceedings First INTAS International Seminar on Coding Theory and
Combinatorics 1996, Thahkadzor, Armenia, 20-33, 6-11 October 1996.
[pdf]
[119]
Higher level extremal problems,
(with N. Cai and Z. Zhang),
Comb. Inf. & Syst. Sc., Vol. 21, No. 3-4, 185-210.
[pdf]
1997
[120]
On interactive communication,
(with N. Cai and Z. Zhang),
IEEE Trans. Inf. Theory, Vol. 43, No. 1, 22-37.
[pdf]
[121]
Identification via compressed data,
(with E. Yang and Z. Zhang),
IEEE Trans. Inf. Theory, Vol. 43, No. 1, 48-70.
[pdf]
[122]
The complete intersection theorem for systems of finite sets,
(with L.H. Khachatrian),
European J. Combinatorics, 18, 125-136.
[pdf]
[123]
Universal coding of integers and unbounded search trees,
(with T.S. Han and K. Kobayashi),
IEEE Trans. Inf. Theory, Vol. 43, No. 2, 669-682.
[pdf]
[124]
Number theoretic correlation inequalities for Dirichlet densities,
(with L.H. Khachatrian),
J. Number Theory, Vol. 63, No. 1, 34-46.
[pdf]
[125]
General edge-isoperimetric inequalities, Part 1:
Information theoretical methods,
(with Ning Cai),
European J. of Combinatorics 18, 355-372.
[pdf]
[126]
General edge-isoperimetric inequalities,
Part 2: A local-global principle for lexicographical solutions,
(with Ning Cai),
European J. of Combinatorics 18, 479-489.
[pdf]
[127]
Models of multi-user write-efficient memories and
general diametric theorems,
(with N. Cai),
Information and Computation, Vol. 135, No. 1, 37-67.
[pdf]
[128]
Shadows and isoperimetry under the sequence-subsequence relation,
(with N. Cai),
Combinatorica 17 (1), 11-29.
[pdf]
[129]
Counterexample to the Frankl/Pach conjecture for uniform, dense
families,
(with L.H. Khachatrian),
Combinatorica 17 (2), 299-301.
[pdf]
[130]
Correlated sources help the transmission over AVC,
(with N. Cai),
IEEE Trans. Inf. Theory, Vol. 43, No. 4, 1254-1255.
[pdf]
1998
[131]
Common randomness in Information Theory and Cryptography, Part II:
CR capacity,
(with I. Csiszár),
IEEE Trans. Inf. Theory, Vol. 44, No. 1, 225-240.
[pdf]
[132]
The diametric theorem in Hamming spaces -- optimal anticodes,
(with L.H. Khachatrian)
Proceedings First INTAS International Seminar on Coding Theory and
Combinatorics 1996, Thahkadzor, Armenia, 1-19, 6-11 October 1996;
Advances in Applied Mathematics 20, 429-449.
[pdf]
[133]
Information and Control: Matching channels,
(with N. Cai),
IEEE Trans. Inf. Theory, Vol. 44, No. 2, 542-563.
[pdf]
[134]
Zero-error capacity for models with memory and the enlightened
dictator channel,
(with N. Cai and Z. Zhang),
IEEE Trans. Inf. Theory, Vol. 44, No. 3, 1250-1252.
[pdf]
[135]
Code pairs with specified parity of the Hamming distances,
(with Z. Zhang),
Discrete Mathematics 188, 1-11.
[pdf]
[136]
Isoperimetric theorems in the binary sequences of finite lengths,
(with Ning Cai),
Applied Math. Letters, Vol. 11, No. 5, 121-126.
[pdf]
[137]
The intersection theorem for direct products,
(with H. Aydinian and L.H. Khachatrian),
European Journal of Combinatorics 19, 649-661.
[pdf]
1999
[138]
Construction of uniquely decodable codes for the two-user binary
adder channel,
(with V.B. Balakirsky),
IEEE Trans. Inf. Theory, Vol 45, No. 1, 326-330.
[pdf]
[139]
Arbitrarily varying multiple-access channels, Part I.
Ericson's symmetrizability is adequate, Gubner's conjecture is true,
(with N. Cai),
IEEE Trans. Inf. Theory, Vol. 45, No. 2, 742-749.
[pdf]
[140]
Arbitrarily varying multiple-access channels,
Part II. Correlated sender's side information, correlated messages,
and ambiguous transmission,
(with N. Cai),
IEEE Trans. Inf. Theory, Vol. 45, No. 2, 749-756.
[pdf]
[141]
A pushing-pulling method: new proofs of intersection theorems,
(with L.H. Khachatrian),
Combinatorica 19(1), 1-15.
[pdf]
[142]
A counterexample in rate-distortion theory for correlated sources,
(with Ning Cai),
Applied Math. Letters, Vol. 12, No. 7, 1-3.
[pdf]
[143]
On maximal shadows of members in left-compressed sets,
(with Zhen Zhang),
Proceedings of the Rostock Conference, Discrete Applied Math. 95, 3-9.
[pdf]
[144]
A counterexample to Kleitman's conjecture concerning an
edge-isoperimetric problem,
(with Ning Cai),
Combinatorics, Probability and Computing 8, 301-305.
[pdf]
[145]
Identification without randomization,
(with Ning Cai),
IEEE Trans. Inf. Theory, Vol. 45, No. 7, 2636-2642.
[pdf]
[146]
On the quotient sequence of sequences of integers,
(with L.H. Khachatrian and A. Sárközy),
Acta Arithmetica, XCI.2, 117-132.
[pdf]
[147]
On the counting function for primitive sets of integers,
(with L.H. Khachatrian and A. Sárközy),
J. Number Theory 79, 330-344.
[pdf]
[148]
On the Hamming bound for nonbinary localized-error-correcting codes,
(with L.A. Bassalygo and M.S. Pinsker),
Problemy Per. Informatsii, Vol. 35, No. 2, 29-37,
Probl. of Inf. Transmission, Vol. 35, No. 2, 117-124.
[pdf]
[149]
Asymptotical isoperimetric problem, (with Z. Zhang),
Proceedings 1999 IEEE ITW, Krüger National Park, South Africa, June
20-25, 85-87.
[pdf]
[150]
Nonstandard coding method for nonbinary codes correcting localized
errors, (with L. Bassalygo and M. Pinsker),
Proceedings 1999 IEEE ITW, Krüger National Park, South Africa, June
20-25, 78-79.
[pdf]
2000
[151]
On prefix-free and suffix-free sequences of integers,
(with L.H. Khachatrian and A. Sárközy),
Numbers, Information and Complexity, Special volume in honour of
R. Ahlswede on occasion of his 60th birthday, editors I. Althöfer,
N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy,
I. Wegener, and Z. Zhang, Kluwer Acad. Publ.,
Boston, Dordrecht, London, 1-16.
[pdf]
[152]
Splitting properties in partially ordered sets and set systems,
(with L.H. Khachatrian),
Numbers, Information and Complexity, Special volume in honour of
R. Ahlswede on occasion of his 60th birthday, editors I. Althöfer,
N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy,
I. Wegener, and Z. Zhang, Kluwer Acad. Publ.,
Boston, Dordrecht, London, 29-44.
[pdf]
[153]
The AVC with noiseless feedback and maximal error probability: A
capacity formula with a trichotomy,
(with N. Cai),
Numbers, Information and Complexity, Special volume in honour of
R. Ahlswede on occasion of his 60th birthday, editors I. Althöfer,
N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy,
I. Wegener, and Z. Zhang, Kluwer Acad. Publ.,
Boston, Dordrecht, London, 151-176.
[pdf]
[154]
A diametric theorem for edges,
(with L.H. Khachatrian),
J. Comb. Theory, Series A 92, 1-16.
[pdf]
[155]
Network information flow,
(with Ning Cai, S.Y. Robert Li, and Raymond W. Yeung),
Preprint 98-033, SFB 343 ``Diskrete Strukturen in der Mathematik'',
Universität Bielefeld,
IEEE Trans. Inf. Theory, Vol. 46, No. 4, 1204-1216.
[pdf]
2001
[156]
On perfect codes and related concepts,
(with H. Aydinian and L.H. Khachatrian),
Designs, Codes and Cryptography, 22, 221-237.
[pdf]
[157]
Quantum data processing,
(with Peter Löber),
IEEE Trans. Inf. Theory, Vol. 47, No. 1, 474-478.
[pdf]
[158]
On primitive sets of squarefree integers,
(with L.H. Khachatrian and A. Sárközy),
Periodica Mathematica Hungarica Vol. 42 (1-2), 99-115.
[pdf]
[159]
Advances on extremal problems in number theory and combinatorics,
European Congress of Mathematics, Barcelona 2000, Vol. I, 147-175,
Carles Casacuberta, Rosa Maria Miró-Roig, Joan Verdera, Sebastiá
Xambó-Descamps (Eds.), Progress in Mathematics, Vol. 201,
Birkhäuser Verlag, Basel-Boston-Berlin.
[pdf]
[160]
An isoperimetric theorem for sequences generated by feedback and
feedback-codes for unequal error protection,
(with N. Cai and C. Deppe),
Problemy Peredachi Informatsii, No. 4, 63-70, 2001,
Transmission Problems of Information Transmission, Vol. 37, No. 4,
332-338.
[pdf]
2002
[161]
Strong converse for identification via quantum channels,
(with A. Winter),
IEEE Trans. Inf. Theory, Vol. 48, No. 3, 569-579.
[pdf]
[162]
Parallel error correcting codes,
(with B. Balkenhol and N. Cai),
IEEE Trans. Inf. Theory, Vol. 48, No. 4, 959-962.
[pdf]
[163]
Semi-noisy deterministic multiple-access channels: coding theorems
for list codes and codes with feedback,
(with N. Cai),
IEEE Trans. Inf. Theory, Vol. 48, No. 8, 2953-2962.
[pdf]
[164]
The -intersection problem in the truncated Boolean lattice,
(with C. Bey, K. Engel, and L.H. Khachatrian),
European Journal of Combinatorics 23, 471-487.
[pdf]
[165]
Unidirectional error control codes and related combinatorial problems,
(with H. Aydinian and L.H. Khachatrian),
in Proceedings of Eight International workshop on Algebraic and
Combinatorial Coding Theory, 8-14 September, Tsarskoe Selo,
Russia, 6-9.
[pdf]
2003
[166]
Forbidden (0,1)-vectors in hyperplanes of
:
The restricted case,
(with H. Aydinian and L.H. Khachatrian),
Designs, Codes and Cryptography, 29, 17-28.
[pdf]
[167]
Cone dependence -- a basic combinatorial concept,
(with L.H. Khachatrian),
Designs, Codes and Cryptography, 29, 29-40.
[pdf]
[168]
More about shifting techniques,
(with H. Aydinian and L.H. Khachatrian),
European Journal of Combinatorics 24, 551-556.
[pdf]
[169]
On lossless quantum data compression and quantum variable-length codes,
(with Ning Cai),
Chapter 6 in ``Quantum Information Processing'', Gerd Leuchs, Thomas
Beth (Eds.), Wiley-VCH Verlag, Weinheim, Germany, 66-78.
[pdf]
[170]
Maximum number of constant weight vertices of the unit
-cube contained in a
-dimensional subspace,
(with H. Aydinian and L.H. Khachatrian),
Combinatorica, Vol. 23 (1), 5-22.
[pdf]
[171]
A complexity measure for families of binary sequences
(with L.H. Khachatrian, C. Mauduit, and A. Sárközy),
Periodica Mathematica Hungarica, Vol. 46 (2), 107-118.
[pdf]
[172]
Extremal problems under dimension constraints,
(with H. Aydinian and L.H. Khachatrian),
Discrete Mathematics, Special issue: EuroComb'01 - Edited by
J. Nesetril, M. Noy and O. Serra, Vol. 273, No. 1-3, 9-21.
[pdf]
[173]
Maximal antichains under dimension constraints,
(with H. Aydinian and L.H. Khachatrian),
Discrete Mathematics, Special issue: EuroComb'01 - Edited by
J. Nesetril, M. Noy and O. Serra, Vol. 273, No. 1-3, 23-29.
[pdf]
[174]
Large deviations in quantum information theory,
(with V. Blinovsky),
Probl. of Inf. Transmission, Vol. 39, Issue 4, 373-379.
[pdf]
2004
[175]
On Bohman's conjecture related to a sum packing problem of Erdos,
(with H. Aydinian and L.H. Khachatrian),
Proceedings of the American Mathematical Society,
Vol. 132, No. 5, 1257-1265.
[pdf]
[176]
On shadows of intersecting families,
(with H. Aydinian and L.H. Khachatrian),
Combinatorica 24 (4), 555-566.
[pdf]
[177]
On lossless quantum data compression with a classical helper,
(with Ning Cai),
IEEE Trans. Inf. Theory, Vol. 50, No. 6,
[pdf]
[178]
On the density of primitive sets,
(with L.H. Khachatrian and A. Sárközy),
J. Number Theory 109, 319-361.
[pdf]
Forbidden (0,1)-vectors in Hyperplanes of
:
The unrestricted case,
(with L.H. Khachatrian and H. Aydinian)
Designs, Codes and Cryptography 37, 151-167.
[pdf]
[181]
Nonbinary error correcting codes with noiseless feedback, localized errors
or both, (with C. Deppe and V. Lebedev), Annals of European Academy of
Sciences, No. 1, 285 - 309.
[pdf]
2006
[182]
Search with noisy and delayed responses, (with N. Cai),
General Theory of Information Transfer and Combinatorics,
Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 695-703.
[pdf]
[183]
Watermarking identification codes with related topics in common
randomness, (with N. Cai),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 107-153.
[pdf]
[184]
Large families of pseudorandom sequences of symbols and their
complexity, Part I, (with C. Mauduit and A. Sárközy),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 293-307.
[pdf]
[185]
Large families of pseudorandom sequences of symbols and their
complexity, Part II, (with C. Mauduit and A. Sárközy),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 308-325.
[pdf]
[186]
A Kraft-type inequality for -delay binary search codes,
(with N. Cai),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 704-706.
[pdf]
[187]
Sparse asymmetric connectors in communication networks,
(with H. Aydinian)
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 1056-1062.
[pdf]
[188]
A strong converse theorem for quantum multiple access channels,
(with N. Cai),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 460-485.
[pdf]
[189]
Codes with the identifiable parent property and the multiple-access
channel, (with N. Cai)
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 249-257.
[pdf]
[190]
Estimating with randomized encoding the joint empirical distribution
in a correlated source, (with Zhen Zhang),(Preliminary version:
Worst case estimation of permutation invariant functions and
identification via compressed data,
(with Zhen Zhang),
Preprint 97-005, SFB 343 ``Diskrete Strukturen in der Mathematik'',
Universität Bielefeld)
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 535-546.
[pdf]
[191]
On attractive and friendly sets in sequence spaces,
(with L.H. Khachatrian),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 955-970.
[pdf]
[192]
Information theoretic models in language evolution,
(with E. Arikan, L. Bäumer and C. Deppe),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 769-787.
Accepted as Language Evolution and Information Theory in ISIT, Chicago
June 27 - July 2, 2004.
[pdf]
[193]
A fast suffix-sorting algorithm,
(with B. Balkenhol, C. Deppe, and M. Fröhlich),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 719-734.
[pdf]
[194]
On partitions of a rectangle into rectangles with restricted
number of cross sections,
(with A. Yudin),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 941-954.
[pdf]
[195]
On concepts of performance parameters for channels,
(Original version: Concepts of performance parameters for channels,
Preprint 00-126, SFB 343 ``Diskrete Strukturen in der Mathematik'',
Universität Bielefeld)
General Theory of Information Transfer and Combinatorics,
Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 639-663.
[pdf]
[196]
Report on models of write-efficient memories with localized errors
and defects, (with M.S. Pinsker),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 628-632.
[pdf]
[197]
Correlation inequalities in function spaces,
(with V. Blinovsky),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 572-577.
[pdf]
[198]
Solution of Burnashev's Problem and a sharpening of the
Erdos/Ko/Rado Theorem,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 1006-1009.
[pdf]
[199]
Transmission, identification and common randomness capacities for
wire-tape channels with secure feedback from the decoder,
(with Ning Cai),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 258-275.
[pdf]
[200]
On set coverings in Cartesian product spaces,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 926-937.
[pdf]
[201]
Identification for sources,
(with B. Balkenhol and C. Kleinewächter),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 51-61.
[pdf]
[202]
Secrecy Systems for Identification Via Channels with Additive-Like
Instantaneous Block Encipherers,
(with Ning Cai and Zhaozhi Zhang),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 285-292.
[pdf]
[203]
Identification Entropy,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 595-613.
[pdf]
[204]
On Logarithmically Asymptotically Optimal Hypothesis Testing for
Arbitrarily Varying Sources with Side Information,
(with Evgueni Haroutunian and Ella Aloyan),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 547-552.
[pdf]
[205]
On Logarithmically Asymptotically Optimal Testing of Hypothesis and
Identification,
(with Evgueni Haroutunian),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 553-571.
[pdf]
[206]
Problems in Network coding and error correcting codes,
(with S. Riis),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 861-897.
[pdf]
[207]
On edge-isoperimetric theorems for uniform hypergraphs,
(with N. Cai),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer
Science, Vol. 4123, Springer Verlag, 979-1005.
[pdf]
[208]
An interpretation of identification entropy,
(with N. Cai), IEEE Trans. Inf. Theory, Vol. 52, No. 9, 4198-4207.
[pdf]
[209]
Construction of asymmetric connectors of depth two,
(with H. Aydinian)
Special Issue in Honor of
Jacobus H. van Lint of J. Combinatorial Theory, Series A, Vol. 113, No. 8, 1614-1620.
[pdf]
[210]
Maximal sets of integers not containing pairwise coprimes and
having divisors from a specified set of primes, (with V. Blinovsky),
Special Issue in Honor of
Jacobus H. van Lint of J. Combinatorial Theory, Series A, Vol. 113, No. 8, 1621-1628.
[pdf]
[211]
About the number of step functions with restrictions,
(with V. Blinovsky),
Probability Theory and Applications,
Vol. 50, No. 4, 537-560.
[pdf]
[212]
Another diametric theorem in Hamming spaces: optimal group anticodes,
Proc. IEEE Information Theory Workshop, Punta del Este, Uruguay, March 13-17, 212-216.
[pdf]
[213]
Intersection theorems under dimension constraints part I: the
restricted case and part II: the unrestricted case,
(with H. Aydinian and L.H. Khachatrian),
J. Comb. Theory, Series A 113, 483-519.
[pdf]
[214]
On q-ary codes correcting all unidirectional errors of a limited
magnitude, (with H. Aydinian, L.H. Khachatrian, L.M. Tolhuizen),
Special issue dedicated to the memory of Varshamov, Abstract
included in Proceedings of the International workshop on Algebraic and
Combinatorial Coding Theory (ACCT), Kranevo, Bulgaria,
June 19 - 25, 2004, Preprint in Arxiv, CS.IT-0607132.
[pdf]
2007
[215]
On the oblivious transfer capacity, (with I. Csiszàr),
ISIT, Proceedings of the IEEE International Symposium on Information Theory, 2061-2064.
[pdf]
[216]
Classical capacity of classical-quantum arbitrarily varying channels, (with V. Blinovsky),
IEEE Trans. Inf. Theory, Vol. 53, No. 2, 526-533.
[pdf]
[217]
The final form of Tao's inequality relating conditional expectation
and conditional mutual information, Advances in Mathematics of
Communications, Vol. 1, No. 2, 239-242.
[pdf]
[218]
Towards a General Theory of Information Transfer, Shannon
Lecture at ISIT in Seattle 13th July 2006,
IEEE Inform. Theory Society Newsletter, Vol. 57, No. 3, 6-28.
[pdf]
2008
[219]
Error control codes for parallel asymmetric channels, (with H. Aydinian),
IEEE Trans. Inf. Theory, Vol. 54, No. 2, 831 - 836.
[pdf]
[220]
General theory of information transfer: updated,
(Original version: General theory of information transfer,
Preprint 97-118, SFB 343 ``Diskrete Strukturen in der Mathematik'',
Universität Bielefeld)
General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1348-1388
[DOI: 10.1016/j.dam.2007.07.007].
[pdf]
[221]
Searching with lies under error transition cost constraints,
(with F. Cicalese and C. Deppe),
General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1444-1460,
[DOI: 10.1016/j.dam.2007.04.033].
[pdf]
[222]
T-Shift synchronization Codes,
(with B. Balkenhol, C. Deppe, H. Mashurian and T. Partner),
General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1461-1468,
[DOI: 10.1016/j.dam.2007.06.020].
[pdf]
[223]
Rate-wise optimal non-sequential search strategies under a
cardinality constraint on the tests,
General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1431-1443,
[DOI: 10.1016/j.dam.2006.06.013].
[pdf]
[224]
On the correlation of binary sequences,
(with J. Cassaigne and A. Sárközy),
General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1478-1487,
[DOI: 10.1016/j.dam.2006.11.021].
[pdf]
[225]
Multiple packing in sum-type metric spaces,
(with V. Blinovsky),
General Theory of Information Transfer and Combinatorics,
Special Issue of Discrete Applied Mathematics, Vol. 156, No. 9, 1469-1477,
[DOI: 10.1016/j.dam.2007.07.012].
[pdf]
[226]
Towards Combinatorial Algebraic Number Theory, (with V. Blinovsky),
Lectures on Advances in Combinatorics, (with V. Blinovsky),
Universitext, Springer, 275-284.
[pdf]
[227]
A diametric theorem in
for Lee and related distances,
(with F.I. Solov'eva), Proceedings of the Second International Castle Meeting on Coding Theory and Applications, Lecture Notes in Computer Science, Vol. 5228, 1-10.
[pdf]
[228]
On diagnosability of large multiprocessor networks,
(with H. Aydinian),
Discrete Applied Mathematics, Vol. 156, No. 18, 3464-3474.
[pdf]
2009
[229]
Two batch search with lie cost, (with F. Cicalese, C. Deppe, and U. Vaccaro),
IEEE Trans. Inf. Theory, Vol. 55, No. 4, 1433-1439.
[pdf]
[230]
Interactive communication, diagnosis, and error control in networks,
(with H. Aydinian),
Algorithmics of Large and Complex Networks
(Design, Analysis, and Simulation), J. Lerner, D. Wagner, and K. Zweig (Eds.),
Lecture Notes in Computer Science, Vol. 5515, 197-226.
[pdf]
[231]
On error control codes for random network coding,
(with H. Aydinian),
Proceedings of NetCod 09,
Workshop on Network Coding, Theory, and Applications, Lausanne, 15-16 June 2009, 68 - 73.
[pdf]
2010
[232]
Entanglement transmission under adversarially
selected quantum noise,
(with I. Bjelakovic, H. Boche, and J. Nötzel)
DPG-Frühjahrstagung in Hannover,
Preprint in Arxiv, arXiv:1004.5551v1.
[pdf]
[233]
Every channel with time structure has a capacity sequence,
Proceedings of the IEEE Information Theory Workshop in Dublin,
August 30 - September 3, 2010.
[pdf]
2011
[234]
On security of statistical databases, (with H. Aydinian),
SIAM Journal on Discrete Mathematics, Vol. 25, No. 4, 1778-1791.
[pdf]
2012
[235]
On generic erasure correcting sets and related problems,
(with H. Aydinian),
IEEE Trans. Inf. Theory, Vol. 58, No. 2, 501-508.
[pdf]
[236]
Shadows under the word-subword relation,
(with V. Lebedev),
Problems of Information Transmission, Vol. 48, No. 1, 31-46.
[pdf]
[237]
Finding one of D defective elements in some
group testing models, (with C. Deppe and V. Lebedev),
Problems of Information Transmission, Vol. 48, No. 2, 173-181.
[pdf]
submitted
[238]
New construction of error-tolerant pooling designs,
(with H. Aydinian),
Problemy Peredachi Informatsii.
[pdf]
to appear
[239]
Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
(with I. Bjelakovic, H. Boche, and J. Nötzel)
Communications in Mathematical Physics.
(Preprint in Arxiv, arXiv:1010.0418v2).
[pdf]
[240]
Threshold and majority group testing, (with C. Deppe and V. Lebedev),
LNCS Festschrifts.
[pdf]
[241]
The Restricted Word Shadow Problem, (with V. Lebedev),
LNCS Festschrifts.
[pdf]
[242]
The oblivious transfer capacity, (with I. Csiszàr),
LNCS Festschrifts.
[pdf]