-
1
-
-
0036038537
-
Finding maximum independent sets in graphs arising from coding theory
-
S. Butenko, P. Pardalos, I. Sergienko, V. Shylo, and P. Stetsyuk. Finding maximum independent sets in graphs arising from coding theory. In Proceedings of the 2002 ACM Symposium on Applied Computing, pp. 542-546, 2002.
-
(2002)
Proceedings of the 2002 ACM Symposium on Applied Computing
, pp. 542-546
-
-
Butenko, S.1
Pardalos, P.2
Sergienko, I.3
Shylo, V.4
Stetsyuk, P.5
-
2
-
-
0142008323
-
Concatenated codes for deletion channels
-
J. Chen, M. Mitzenmacher, C. Ng, and N. Varnica. Concatenated codes for deletion channels. In Proceedings of the IEEE International Symposium on Information Theory, p. 218, 2003.
-
(2003)
Proceedings of the IEEE International Symposium on Information Theory
, pp. 218
-
-
Chen, J.1
Mitzenmacher, M.2
Ng, C.3
Varnica, N.4
-
3
-
-
0035246117
-
Reliable Communication over Channels with Insertions, Deletions, and Substitutions
-
M.C. Davey and D.J.C. MacKay. Reliable Communication over Channels with Insertions, Deletions, and Substitutions. IEEE Transactions on Information Theory, volume 47, number 2, pp. 687-698, 2001.
-
(2001)
IEEE Transactions on Information Theory
, vol.47
, Issue.2
, pp. 687-698
-
-
Davey, M.C.1
MacKay, D.J.C.2
-
4
-
-
33947390339
-
On Lower Bounds for the Capacity of Deletion Channels
-
E. Drinea and M. Mitzenmacher. On Lower Bounds for the Capacity of Deletion Channels. IEEE Transactions on Information Theory, volume 52, number 10, pp. 4648-4657, 2006.
-
(2006)
IEEE Transactions on Information Theory
, vol.52
, Issue.10
, pp. 4648-4657
-
-
Drinea, E.1
Mitzenmacher, M.2
-
5
-
-
33947373872
-
A Simple Lower Bound for the Capacity of the Deletion Channel
-
M. Mitzenmacher and E. Drinea. A Simple Lower Bound for the Capacity of the Deletion Channel. IEEE Transactions on Information Theory, volume 52, number 10, pp. 4657-4660, 2006.
-
(2006)
IEEE Transactions on Information Theory
, vol.52
, Issue.10
, pp. 4657-4660
-
-
Mitzenmacher, M.1
Drinea, E.2
-
7
-
-
17444378998
-
Marker codes for channels with insertions and deletions
-
January-February
-
E. Ratzer. Marker codes for channels with insertions and deletions. Annab of Telecommunications, 60:1-2, p. 29-44, January-February 2005.
-
(2005)
Annab of Telecommunications
, vol.60
, Issue.1-2
, pp. 29-44
-
-
Ratzer, E.1
-
8
-
-
39049117326
-
On Single-Deletion-Correcting Codes
-
Arxiv preprint math.CO/0207197
-
N. Sloane. On Single-Deletion-Correcting Codes. Arxiv preprint math.CO/0207197, 2002.
-
(2002)
-
-
Sloane, N.1
-
10
-
-
0008159455
-
Codes which correct single asymmetric errors
-
in Russian
-
R. R. Varshamov and G. M. Tenengolts. Codes which correct single asymmetric errors (in Russian), Automatika i Telemekhanika, 26:2, pp. 288-292, 1965.
-
(1965)
Automatika i Telemekhanika
, vol.26
, Issue.2
, pp. 288-292
-
-
Varshamov, R.R.1
Tenengolts, G.M.2
-
11
-
-
0008159455
-
-
English translation in
-
English translation in Automation and Remote Control, 26:2, pp. 286-290, 1965.
-
(1965)
Automation and Remote Control
, vol.26
, Issue.2
, pp. 286-290
-
-
|