CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
D.C. Youla. On the factorization of rational matrices. IEEE Transactions on Information Theory, pp. 172-189, July 1961.
A. Gersho. On the structure of vector quantizers. IEEE Transactions on Information Theory, 28(2):157--166, 1982.
B. M. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31, 1985, pp. 509-517.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
, On the Shannon Capacity of a Graph, IEEE Transactions on Information Theory, Vol. IT-25, no. 1, January 1979.
Chazelle, B., On the convex layers of a planar set, IEEE Transactions on Information Theory, IT-31, pp. 509-517, 1985.
A. Gersho. On the Structure of Vector Quantizers. IEEE Transactions on Information Theory, Vol. 28, No. 2, pp. 157--166, March 1982.
A. Gersho. On the structure of vector quantizers. IEEE Transactions on Information Theory, 28(2):157--166, 1982.
D. V. Sarwate. On the complexity of decoding Goppa codes. IEEE Transactions on Information Theory, 23(4):515--516, July 1977.
A. Gersho. On the Structure of Vector Quantizers. IEEE Transactions on Informa- tion Theory , Vol. 28, No. 2, pp. 157--166, March 1982.
A. Gersho. On the structure of vector quantizers. IEEE Transactions on Information Theory, 28(2):157--166, 1982.
L. LOVASZ. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31:509--517, 1985.
L. Lovasz. On the shannon capacity of a graph. IEEE Transactions on Information theory, IT-25 (1979).
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, 31(4):509--517, July 1985.
D. V. Sarwate. On the complexity of decoding Goppa codes. IEEE Transactions on Information Theory, 23(4):515--516, July 1977.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31(4):509--517, 1985.
J. Simonis, On generator matrices of codes, IEEE Transactions on Information Theory, IT-38, 1992, p. 516.
R.C. Wood. On optimum quantization. IEEE Transactions on Information Theory, IT-15(2):248--252, 1969.
On the shape of a set of points in the plane. IEEE Transactions on Information Theory, IT-29#4#:551# 559, 1983.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
R.C. Wood. On optimum quantization. IEEE Transactions on Information Theory, IT-15(2):248--252, 1969.
Chazelle, B., On the convex layers of a planar set, IEEE Transactions on Information Theory, IT-31, pp. 509-517, 1985.
S.M. Reddy: On Decoding Iterated Codes, IEEE Transaction on Information Theory, Vol. 16(5), pp. 624--627, 1970.
H.Stichtenoth: On the dimension of subfield subcodes, IEEE Transactions on Information Theory 36 (1990),90-93.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25(1):1--7, 1979.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT31: 509--517, 1985.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31(4):509--517, 1985.
, "On the Performance and Complexity of Channel Optimized Vector Quantizers", IEEE Transactions on Information Theory 37 (1991), no. 1, 155--160.
, "On the Performance and Complexity of Channel Optimized Vector Quantizers", IEEE Transactions on Information Theory 37 (1991), no. 1, 155--160.
J.H. van Lint and R.M. Wilson, On the minimum distance of cyclic codes, IEEE Transactions on Information Theory, vol. 32, pp. 23-40, January 1986. 12
B. Chazelle, On the Convex Layers of a Planar Set, IEEE Transactions on Information Theory, 31(4):509517, 1985.
L. Lovasz. On the Shannon Capacity of a graph. IEEE Transactions of Information Theory, IT-25(1):1--7, January 1979.
L. Lovasz. On the Shannon Capacity of a graph. IEEE Transactions of Information Theory, IT-25(1):1--7, January 1979.
L. Lovasz. On the Shannon Capacity of a graph. IEEE Transactions of Information Theory, IT-25(1):1--7, January 1979.
M. van Dijk: On a Special Class of Broadcast Channels with Confidential Messages, IEEE Transactions on Information Theory, V. 43, No. 2, pp. 712-714, March 1997.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions of Information Theory, IT-25(1):1--7, January 1979.
M. Costa. Writing on dirty paper. IEEE Transactions on Information Theory, 29(3):439--441, May 1983.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31(4):509--517, 1985.
L. Lovasz, On the Shannon capacity of a graph, IEEE Transactions on Information Theory, 25(1979), pp. 1-7.
B. Chazelle. On the convex layers of a planar set. IEEE1 Transactions on Information Theory, 31, 1985.
L. Lovasz, On the Shannon capacity of a graph, IEEE Transactions on Information Theory, 25(1979), pp. 1-7.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT31: 509--517, 1985.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT31: 509--517, 1985.
Chazelle, B., On the convex layers of a planar set, IEEE Transactions on Information Theory, IT-31, pp. 509-517, 1985.
Chazelle, B., On the convex layers of a planar set, IEEE Transactions on Information Theory, IT-31, pp. 509-517, 1985.
M. H. M. Costa. Writing on Dirty Paper. IEEE Transactions on Information Theory, 29(3):439--441, May 1983.
M. H. M. Costa. Writing on Dirty Paper. IEEE Transactions on Information Theory, 29(3):439-441, May 1983.
X. M. Zhang and Y. Zheng. On plateaued functions. IEEE Transactions on Information Theory, 2000. (accepted).
B. Gordon, On the existence of perfect maps, IEEE Transactions on Information Theory, IT-12 (1966), 486-487.
M. H. M. Costa. Writing on Dirty Paper. IEEE Transactions on Information Theory, 29(3):439441, May 1983.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
D. Kazakos. On the optimal linear feature. IEEE Transactions on Information Theory, 24:6514552, 1978.
A. Gersho. On the structure of vector quantizers. IEEE Transactions on Information Theory, 28(2):157--166, 1982.
B. Chazelle. On the convex layers of a planar set. IEEE1 Transactions on Information Theory, 31, 1985.
R.C. Wood. On optimum quantization. IEEE Transactions on Information Theory, IT-15(2):248--252, 1969. 110
L. Low4sz. On the Shannon capacity of a g'aph. IEEE Transactions on Information Theory, 25(1):1 7, January 1979.
D. Kazakos. On the optimal linear feature. IEEE Transactions on Information Theory, 24:6514552, 1978.
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, 31:509-517, 1985. 18
B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, 31:509--517, 1985.
M. H. M. Costa. Writing on dirty paper. IEEE Transactions on Information Theory, IT-29:439--441, May 1983.
M. Costa. Writing on dirty paper. IEEE Transactions on Information Theory, pages 439--441, May 1983. 21
J. K. Omura. On the Viterbi Decoding Algorithm. IEEE Transactions on Information Theory, 15:177--179, January 1969.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
B. Chazelle, On the convex layers of a planar set, IEEE Transactions on Information Theory, 31(4) (1985), 509-517.
M. H. M. Costa: Writing on dirty paper, IEEE Transactions on Information Theory, pp. 439 - 441, May (1983)
M.H. Costa. Writing on dirty paper. IEEE Transactions on Information Theory, 29(3):439{ 441, May 1983.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:2--13, 1979.
L. Lovasz. On the shannon capacity of a graph. IEEE transaction on Information Theory, 25, 1979.
L. Lov'asz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
, On the security of iterated Message Authentication Codes, IEEE Transactions on Information Theory 45 (1999), 188--199.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information theory, 25, 1979.
L. Lovasz. On the shannon capacity of a graph. IEEE Transactions on Information theory, IT-25 (1979).
L. Lovasz. On the shannon capacity of a graph. IEEE Transactions on Information theory, IT-25 (1979).
L. Lov'asz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
------, "Comments on broadcast channels," IEEE Transactions on Information Theory, vol. 44, pp. 2524--2530, 1998.
D. Mandelbaum : On a Class of Arithmetic Codes and Decoding Algorithm. IEEE Transactions on Information Theory, Vol. IT-21 (1976) 85-88
E. Ayanoglu. On Optimal Quantization of Noisy Sources. IEEE Transactions on Information Theory, IT-36(6):1450--1452, Nov. 1990.
L. Lov'asz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1--7, 1979.
L. Lovasz. On the Shannon Capacity of a Graph. IEEE Transactions on Information Theory, vol. IT-25, no. 1, Pages 1-7, 1979.
------, "On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis," IEEE Transactions in Information Theory, vol. IT-44, no. 1, pp. 162--171, January 1998.
------, "On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis," IEEE Transactions in Information Theory, vol. IT-44, no. 1, pp. 162--171, January 1998.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
L. Lovasz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1--7, 1979.
------, "On optimal finite-state digital transmission systems," IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 167--186, 1982.
Costa, M.H.M.: Writing on dirty paper. IEEE Transactions on Information Theory 29 (1983) 439--441