³í¹® Á¤º¸ Ç׸ñÀ» ¼öÁ¤/»èÁ¦ÇÕ´Ï´Ù.
³í¹® Ç׸ñ ÀÔ·Â
ÀÛ¼º¿ä·É
*´Â Çʼö. FA, CA, ±¹¹®ÀúÀÚ Áß º»¿ø ¼Ò¼Ó ³»±¹ÀÎ ±³¼ö ÇлýÀº ¹Ýµå½Ã Çѱ۷Π±âÀç
±¹¹®ÀúÀÚ¶õ¿¡´Â ¸ðµç ÀúÀÚ¸¦ ±âÀçÇÏ°í ¿Ü±¹ÀÎÀº ¿µ¹®À¸·Î ±âÀçÇϸç, ÄĸÓ(,)·Î ±¸ºÐ
Á¦¸ñÀº ±¹¹® ¿µ¹®¶õ¿¡ ÇØ´ç»çÇ×ÀÌ ÀÖ´Â °æ¿ì¿¡¸¸ ±âÀç
¹øÈ£
3270 
ÀÔ·ÂÀÏÀÚ
2004-06-18 
ÀÔ·ÂÀÚ
±è¼±±â 
ÀÔ·Â IP
203.237.51.97 
ºÐ·ù*
±¹Á¦
±¹³»
µî±Þ*
SCI Àú³Î
Non-SCI Àú³Î
Àú¸íÇÐȸ
±âŸÇÐȸ
First Author*
Corresp. Author*
´ã´ç±³¼ö
°µ¿È£
°À±Ã¤
°íµµ°æ
±¸Àμö
±è°¿í
±è°ÀÏ
±è±â¼±
±è´ö¿µ
±èµ¿À¯
±è¸¸¼ö
±èºÎ±Õ
±è¼±µ¿
±èÀÇȯ
±èÀç°ü
±èÁ¾¿ø
±èÈ«±¹
³²È£Á¤
·ùÁ¦ÇÏ
¹Ú°ÇÇõ
¹ÚµµÇö
¹ÚÁö¿õ
¹Úâ¼ö
¹é¿îÃâ
¼®ÅÂÁØ
¼Ò¼ø¹ü
¼ÕÁøÈñ
¼Û°èÈÞ
¼Û¿µ¹Î
¼ÛÁ¾ÀÎ
½Å¼¿ë
½ÅÁ¾¿ø
½ÅÇöÁø
¾Èâ¿í
¾öÁø¼·
¿À°æȯ
¿Àâȯ
¿ì¿îÅÃ
À¯³²¿
À¯ÇÊ¿ø
À°Á¾°ü
À±±¹Áø
À±ÈÆÇÑ
ÀÌ°üÇà
À̵µÇå
À̵¿¼±
À̵¿ÀÍ
À̹ÎÀç
À̺´±Ù
À̺´Ã¶
À̺´ÇÏ
À̼ºÈñ
ÀÌ¿ëŹ
ÀÌÀϹÎ
ÀÌÀå¿ì
ÀÌÀç¼®
ÀÌÁ¾¼ö
ÀÌÁ¾Ã¢
ÀÌÁ¾Ãµ
ÀÌŹÈñ
ÀÌÇöÁÖ
ÀÌÈï³ë
ÀÓÇõ
ÀåÀ¯¸²
ÀåÀçÇü
Àü¹®±¸
Àü»ó¿ë
Àü¼ºÂù
ÀüÇØ°ï
Á¤¿µÁÖ
Á¤Á¦¸í
Á¤ÇöÈ£
Á¶¿µ´Þ
Á¶ÀºÁ¤
Á¶ÀºÇÏ
Á¶ÀåÈñ
ÁÖ¼º¹Î
Â÷º´·¡
ÃÖÀçÈ£
ÃÖÁ¾Çö
ÃÖÁøÈ£
űâÀ¶
Çϵ¿¼ö
ÇÑ¿øÅÃ
ÇÔº´½Â
È«¼º¹Î
È«Àαâ
ȲÀǼ®
A. Ahmad
A. Host-Madsen
J. Giglmayr
Kwang Mong Sim
L. Ludman
R. S. Ramakrishna
Saeid
°ÔÀçÀÏÀÚ*
ÀúÀÚ(±¹¹®)*
Á¤¿íÇö, À±¿µ¼®, È£¿ä¼º
ÀúÀÚ(¿µ¹®)
Wook-Hyun Jeong, Young-Suk Yoon, and Yo-Sung Ho
Á¦¸ñ(±¹¹®)*
Design of Robust Reversible Variable-Length Codes using the Property of Free Distance
Á¦¸ñ(¿µ¹®)*
Design of Robust Reversible Variable-Length Codes using the Property of Free Distance
°ÔÀçÁö*
±Ç¹øÈ£
³í¹®¹øÈ£
ÆäÀÌÁö
³í¹®¸í¼¼
Á¤¿íÇö, À±¿µ¼®, È£¿ä¼º, "Design of Robust Reversible Variable-Length Codes using the Property of Free Distance,"
International Conference on Multimedia and Expo 2004 (ICME2004)
, pp. TP1-1.13~16, 2004.
¹ßÇ¥Àå¼Ò
¹ßÇ¥ÇüÅÂ*
Journal
Oral
Poster
JCR Category
Impact Factor
JCR Cat. ¼øÀ§
of
ÁøÇà»óȲ
Published
Accepted
Submitted
ÇöÀç ÆÄÀϸí
 ICME2004_WHJ.pdf (270KB)
  
ÆÄÀÏ »èÁ¦
»õ ÆÄÀϸí
Acknowledgment
Keywords
reversible variable-length codes (RVLC), free distance, average length function
Abstract
In recent years, reversible variable-length codes (RVLC) have been proposed to recover correct infor-mation from erroneous bitstreams. The free distance of a binary code indicates the strength of the code to transmission errors. Since the minimum free distance of RVLC is one, we cannot assure that encoded data are little exposed. In this paper, we propose a new code design algorithm for robust RVLC by enhancing the free distance. In the proposed algorithm, we exploit properties of the Huffman code and the average length function satisfying the distance condition in order to improve the code performance.
ºñ°í
Password
¼öÁ¤
»èÁ¦
Ãë¼Ò
ÃʱⰪ
»õÇ׸ñ
º¹»ç
°Ë»ö
µÚ·Î
ȨÀ¸·Î
³ª°¡±â