연구동향 분석
박사

Polar Codes for Non-identically Distributed Channels and their Applications to Index Codes : 비동일 분포 병렬 채널을 위한 폴라 부호 기법과 인덱스 코드를 위한 연계 폴라 부호 설계 기법

김장섭 2015년

논문상세정보
    • 저자 김장섭
    • 기타서명 비동일 분포 병렬 채널을 위한 폴라 부호 기법과 인덱스 코드를 위한 연계 폴라 부호 설계 기법
    • 형태사항 26 cm: 삽화, 도표: xii, 139 p.
    • 일반주기 참고문헌 수록
    • 학위논문사항 전기·컴퓨터공학부, 서울대학교 대학원, 학위논문(박사)-, 2015. 8
    • DDC 22, 621.3
    • 발행지 서울
    • 언어 eng
    • 출판년 2015
    • 발행사항 서울대학교 대학원
    • 주제어 ICPC Index codes non-identical channels Polar codes
    유사주제 논문( 12)
인용/피인용
' Polar Codes for Non-identically Distributed Channels and their Applications to Index Codes : 비동일 분포 병렬 채널을 위한 폴라 부호 기법과 인덱스 코드를 위한 연계 폴라 부호 설계 기법' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • icpc
  • index codes
  • non-identical channels
  • polar codes
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
16 0

0.0%

' Polar Codes for Non-identically Distributed Channels and their Applications to Index Codes : 비동일 분포 병렬 채널을 위한 폴라 부호 기법과 인덱스 코드를 위한 연계 폴라 부호 설계 기법' 의 참고문헌

  • Z. Fang and M. Medard “On analyzing and improving COPE performance,” Information Theory and Applications Workshop, Feb. 2010.
  • Z. Bar-Yossef, Z. Birk, T. S. Jayram, and T. Kol. ”Index coding with side information,” IEEE Transactions on Information Theory, vol. 57, no. 3, pp. 1479–1494, 2011.
  • Y. Birk and T. Kol., ”Informed-source coding-on-demand (ISCOD) over broadcast channels,” Proc. IEEE Conf. on Comput. Commun. (INFOCOM), pp. 1257–1264, 1998.
  • Y. Birk and T. Kol., ”Coding-on-demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients,” IEEE Transactions on Information Theory, vol. 52, no 6, pp. 2825–2830, 2006.
  • Wolfram alpha symbolic equation calculator [Online]. Available: http://www.wolframalpha.com
  • W. Park, A. Barg, ”Polar codes for q-ary channels, q = 2r,” arXiv:1107.4965v3, Jan. 2012
  • T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger “On randomized network coding,” Proc. Allerton Conf. on Comm., Control, and Computing, 2003.
  • S.H. Dau, V. Skachek, and Y. M. Chee, ”Error Correction for Index Coding With Side Information,”IEEE Transactions on Information Theory, vol.59, no.3, pp.1517-1531, March 2013
  • S.-Y. R. Li, R. W. Yeung, and N. Cai. “Linear network coding”, IEEE Trans. on Info. Theory, vol. 49. no. 2, pp. 371-381, Feb. 2003.
  • S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, “XORs in the air: practical wireless network coding,” IEEE/ACM Trans. on Networking, vol. 16. no. 3. pp. 497-510, June 2008.
  • S. H. Hassani, S. B. Korada, and R. Urbanke, ”The compound capacity of polar codes,” 47th Annual Allerton Conference, pp.16-21, Sept. 2009
  • S. Eghbalian-Arani and H. Behroozi, ”Polar Codes for a Quadratic-GaussianWyner-Ziv Problem,” Wireless Communication Systems (ISWCS 2013), Proceedings of the Tenth International Symposium on, Aug. 2013
  • S. E. Rouayheb, A. Sprintson and C. Georghiades, ”On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory,” IEEE Transactions on Information Theory, vol.56, no.7, pp.3187-3195, July 2010
  • S. Boyd, L. Vandenberghe, ”Convex Optimization,” Cambridge University Press, 2004
  • S. B. Korada, “Polar codes for channel and source coding,” Ph.D. dissertation, EPFL, 2009.
  • R. Peeters, “Orthogonal representations over finite fields and the chromatic number of graphs,” Combinatorica, vol. 16, no. 3, pp. 417–431, 1996.
  • R. Mori, T. Tanaka, ”Performance of polar codes with the construction using density evolution,” IEEE Communications Letters, vol.13, no.7, pp.519-521, July 2009
  • R. G. Gallager, ”Information Theory and Reliable Communication.” New York: Wiley, 1968, pp. 524.
  • R. Blasco-Serrano, R. Thobaben, M. Andersson, V. Rathi, and M. Skoglund, ”Polar Codes for Cooperative Relaying,” , IEEE Transactions on Communications, vol.60, no.11, pp.3263-3273, 2012
  • R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. on Info. Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
  • P. Maymounkov, A. Harvey, and D. S. Lun, ”Methods for Efficient Network Coding,” in Proc. 44th Annual Allerton Conference on Communication, Control, and Computing, 2006.
  • P. Billingsley, ”Probability and Measure, Anniversary Edition”, Wiley, 2012, pp. 487- 495.
  • P. A. Chou, Y. Wu, and K. Jain, ”Practical Network Coding,” in Proc. Allerton Conference on Communication, Control, and Computing, 2003.
  • P. A. Chou, Y. Wu, and K. Jain, “Practical network coding,” Proc. Allerton Conf. on Comm., Control, and Computing, Monticello, IL, 2003.
  • M. Xiao, M. Skoglund, “Multiple-User Cooperative Communications Based on Linear Network Coding,” IEEE Trans. on Comm, vol. 58, no. 12, pp. 3345-3351, Dec. 2010.
  • M. Xiao, M. Skoglund, “Design of network codes for multiple-user multiple-relay wireless networks,” ISIT 2009, Seoul, Korea, June 2009.
  • M. S. Pinsker, “Capacity of noiseless broadcast channels,” Probl. Inform. Transm., pp. 97–102, June 1978.
  • M. Ghaderi, D. Towsley, and J. Kurose, “Reliability gain of network coding in lossy wireless networks,” IEEE INFOCOM 2008, Apr. 2008.
  • M. Charikar and A. Argawal “On the advantage of network coding for improving network throughput,” IEEE Info. Theory Workshop, San Antonio, Oct. 2004.
  • M. Bloch, L. Luzzi and J. Kliewer, ”Strong coordination with polar codes,” Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on, pp.565-571, 2012
  • M. Andersson, V. Rathi, R. Thobaben, J. Kliewer, and M. Skoglund, ”Nested Polar Codes for Wiretap and Relay Channels,” Communications Letters, IEEE, vol.14, no.8, pp.752-754, August 2010
  • M. Andersson, F. Schaefer, T. Oechtering, M. Skoglund, ”Polar Coding for Bidirectional Broadcast Channels with Common and Confidential Messages,” IEEE Journal onSelected Areas in Communications, vol.31, no.9, pp.1901-1908, 2013
  • M. Alsan, ”Conditions for robustness of polar codes in the presence of channel mismatch,” ArXiv:1303.2379 [cs.IT], 2013.
  • M. Alsan, E. Telatar, ”A simple proof of polarization and polarization for non-stationary channels,” IEEE International Symposium on Information Theory (ISIT) 2014, pp.301- 305, June 2014
  • L. Xiao, T. E. Fuja, J. Kliewer, and D. J. Jr. Costello, ”Nested codes with multiple interpretations,” 40th Annual Conference on Information Sciences and Systems, pp. 851-856, March 2006
  • L. Lu, M. Xiao, L.K. Rasmussen, “Relay-Aided Broadcasting with Instantaneously Decodable Binary Network Codes,” ICCCN 2011, July, 2011.
  • K. Marton, “The capacity region of deterministic broadcast channels,” in Prof. of the IEEE Intern. Symp. on Info. Theory, (Paris-Cachan), 1977.
  • J. G. Proakis and M. Salehi, Digital Communication, 4th ed. McGrawHill, 2001.
  • I. Haviv, M. Langberg, ”On linear index coding for random graphs,” IEEE International Symposium on Information Theory (ISIT), pp.2231-2235, 2012
  • I. Haviv, M. Langberg , ”On linear index coding for random graphs,” arXiv:1107.0390H, 2011
  • H. Mahdavifar, M. El-Khamy, Jungwon Lee, and Inyup Kang, ”Compound polar codes,” Information Theory and Applications Workshop (ITA), pp.1-6, Feb. 2013
  • G. Joshi, E. Soljanin, ”Round-robin overlapping generations coding for fast content download,” IEEE International Symposium on Information Theory Proceedings (ISIT), pp.2740-2744, July 2013
  • E. Sasoglu, ”Polar codes for discrete alphabets,” IEEE International Symposium on Information Theory Proceedings (ISIT) 2012, pp.2137-2141, July 2012
  • E. Sasoglu, Polar Coding Theorems for Discrete Systems. Ph.D. Dissertation, EPFL, Lausanne, Switzerland, 2011.
  • E. Hof, I. Sason, and S. Shamai, ”Polar coding for degraded and non-degraded parallel channels,” IEEE 26th Convention of Electrical and Electronics Engineers in Israel (IEEEI), pp.550-554, Nov. 2010
  • E. Hof, I. Sason, S. Shamai, and Chao Tian, ”Capacity-achieving polar codes for arbitrarily permuted parallel channelsl,” IEEE Transactions on Information Theory, vol.59, no.3, pp.1505-1516, March 2013
  • E. Arikan, ”Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Transactions on Information Theory, vol.55, no.7, pp.3051-3073, July 2009
  • D. Tuninetti and C. Fragouli, “Processing along the way: forwarding vs. coding,” ISITA 2004, Parma, Italy, Oct. 2004.
  • D. Blackwell, L. Breiman, and A. J. Thomasian, “The capacity of a class of channels,” The Annals of Mathematical Statistics, vol. 3, no. 4, pp.1229-1241, 1959.
  • Bin Tang, Shenghao Yang, Yitong Yin, Baoliu Ye, and Sanglu Lu, ”Expander graph based overlapped chunked codes,” IEEE International Symposium on Information Theory Proceedings (ISIT), pp.2451-2455, July 2012
  • Aria G. Sahebi, S. Sandeep Pradhan, “Nested Polar Codes Achieve the Shannon Rate- Distortion Function and the Shannon Capacity,” arXiv:1401.6482 [cs.IT], Jan 2014
  • A. Heidarzadeh, A. H. Banihashemi, ”Overlapped Chunked network coding,” Information Theory Workshop (ITW), Jan. 2010
  • A. Heidarzadeh, A. H. Banihashemi, ”Analysis of overlapped chunked codes with small chunks over line networks,” IEEE International Symposium on Information Theory Proceedings (ISIT), pp.801-805, July 2011
  • A. Eslami and H. Pishro-Nik, ”A practical approach to polar codes,” IEEE International Symposium on Information Theory Proceedings (ISIT) 2011, pp.16-20, July 2011
  • A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman “A simple cooperative diversity method based on network path selection,” IEEE J. on Sel. Areas in Comm., vol. 24. no. 3, pp. 659-672, Mar. 2006.