SCOPUS 정보 검색 플랫폼

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 513-517

A coloring approach to constructing deletion correcting codes from constant weight subgraphs

(3) Cullina, Daniel a Kulkarni, Ankur A a Kiyavash, Negar a

a University of Illinois at Urbana Champaign (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; BIT-STRINGS; CONSTANT WEIGHT; CORRECTING CODES; DELETION-CORRECTING; GRAPH-THEORETIC; HAMMING WEIGHTS; INDEPENDENT SET; INDUCED SUBGRAPHS; LOWER BOUNDS; OPTIMAL COLORING; SUBGRAPHS;

GRAPH THEORY; INFORMATION THEORY; OPTIMIZATION;

OPTIMAL SYSTEMS;

EID: 84867566853 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/ISIT.2012.6284242 Document Type: Conference Paper

Times cited : (19)

References (9)

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," 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.¹ Pardalos, P.² Sergienko, I.³ Shylo, V.⁴ Stetsyuk, P.⁵

2
- 0036160745
- On multiple insertion/deletion correcting codes
- January
- A. S. J. Helberg and H. C. Ferreira, "On multiple insertion/deletion correcting codes," IEEE Trans. Inform. Theory, vol. 48, pp. 305-308, January 2002.
- (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 305-308
- Helberg, A.S.J.¹ Ferreira, H.C.²

3
- 83655193057
- An algorithmic approach for finding deletion correcting codes
- oct.
- F. Khajouei, M. Zolghadr, and N. Kiyavash, "An algorithmic approach for finding deletion correcting codes," Information Theory Workshop (ITW), 2011 IEEE, pp. 25-29, oct. 2011.
- (2011) Information Theory Workshop (ITW), 2011 IEEE , pp. 25-29
- Khajouei, F.¹ Zolghadr, M.² Kiyavash, N.³

4
- 0001116877
- Binary codes capable of correcting deletions, insertions and reversals
- February
- V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Physics - Doklady, vol. 10, no. 8, pp. 707-710, February 1966.
- (1966) Soviet Physics - Doklady , vol.10 , Issue.8 , pp. 707-710
- Levenshtein, V.I.¹

5
- 0035255506
- Efficient reconstruction of sequences from their subsequences or supersequences
- -, "Efficient reconstruction of sequences from their subsequences or supersequences," J. Comb. Theory, vol. 93, no. 2, pp. 310-332, 2001.
- (2001) J. Comb. Theory , vol.93 , Issue.2 , pp. 310-332
- Levenshtein, V.I.¹

6
- 84867514151
- January [Online]. Available
- N. Sloane, "Challenge problems: Independent sets in graphs http://www2.research.att.com/ njas/doc/graphs.html," January 2012. [Online]. Available: http://www2.research.att.com/ njas/doc/graphs.html
- (2012) Challenge Problems: Independent Sets in Graphs Http://www2.research.att. com/ Njas/doc/graphs.html
- Sloane, N.¹

7
- 17444428523
- On single-deletion-correcting codes
- Ohio State University, May
- -, "On single-deletion-correcting codes," Codes and Designs, Ohio State University, pp. 273-292, May 2002.
- (2002) Codes and Designs , pp. 273-292
- Sloane, N.¹

8
- 83655187833
- R. R. Varshamov, "On an arithmetic function with an application in the theory of coding," no. 3, pp. 540-543, 1965.
- (1965) On An Arithmetic Function with An Application in the Theory of Coding , Issue.3 , pp. 540-543
- Varshamov, R.R.¹

9
- 0003736078
- Upper Saddle River, NJ: Prentice Hall Inc.
- D. B. West, Introduction to graph theory. Upper Saddle River, NJ: Prentice Hall Inc., 1996.
- (1996) Introduction to Graph Theory
- West, D.B.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.