基于分离信源信道码的相关信源在有噪广播信道下的可靠和安全传输

doi:10.3969/j.issn.1000-436x.2013.10.003

通信学报 ›› 2013, Vol. 34 ›› Issue (10): 17-27.doi: 10.3969/j.issn.1000-436x.2013.10.003

基于分离信源信道码的相关信源在有噪广播信道下的可靠和安全传输

郎非¹,王保云^1,²,邓志祥¹

¹ 南京邮电大学通信与信息工程学院,江苏南京 210003
² 东南大学移动通信国家重点实验室,江苏南京 210096

出版日期:2013-10-25 发布日期:2017-08-10
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;东南大学移动通信国家重点实验室开放研究基金资助项目

Secure lossless transmission of correlated sources over noisy broadcast channel using separate source-channel coding

Fei LANG¹,Bao-yun WANG^1,²,Zhi-xiang DENG¹

¹ College of Communication and Information Engineeri g,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
² National Mobile Communications Research Laboratory,Southeast University,Nanjing 210096,China

Online:2013-10-25 Published:2017-08-10
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Fund for National Mobile Communications Research Laboratory of Southeast University

摘要/Abstract

摘要：

从信息论的角度对相关信源在离散无记忆广播信道下可靠和安全传输的问题进行研究。2个信源经过有噪信道分别到达各自指定的目的节点并被无损恢复，同时还要保证信源信息对于非指定的目的节点要有一定的保密性。采用信源信道分离的随机码策略，得到相关信源在一般广播信道下能够可靠和安全传输的充分条件。当2个信源的公共信息为二者的互信息时，可获得最佳压缩传输效率，并且能够做到信源信息传输的部分绝对保密。当广播信道采用退化信源集或满足more capable广播信道性质时，得到了可靠和安全传输的充分必要条件，此时分离信源信道码为最优码。

关键词: 分离信源信道码, 安全传输, 广播信道, 疑义度, 香农理论

Abstract:

The problem of secure transmission of correlated sources over broadcast channel was studied from the pers-pective of information-theoretic security.Each source is only for its intended receiver,but to be kept secret from the un-intended receiver.Sufficient condition was provided for secure transmission of correlated sources over broadcast channels from separate source-channel coding perspective.If the mutual information was chosen as common information,optimal compression and partial perfect secrecy were both achieved for two correlated sources.Sufficient and necessary condi-tions were provided for two special cases:a broadcast channel with degraded source sets and a more capable broadcast channel,and thus it could be seen that the separate source-channel code is optimal.

Key words: separate source-channel coding, secure communication, broadcast channel, equivocation, Shannon theory

郎非,王保云,邓志祥. 基于分离信源信道码的相关信源在有噪广播信道下的可靠和安全传输[J]. 通信学报, 2013, 34(10): 17-27.

Fei LANG,Bao-yun WANG,Zhi-xiang DENG. Secure lossless transmission of correlated sources over noisy broadcast channel using separate source-channel coding[J]. Journal on Communications, 2013, 34(10): 17-27.

图/表 3

图1

图2

表1

double-binning"

sub-bin(1)			?	sub-bin(i')			?	$s u b - b i n (2^{n L_{12}})$			bin
$u_{1}^{n} (1, 1, 1)$	?	$u_{1}^{n} (1, 1, 2^{n L_{3}})$	?	$u_{1}^{n} (1, i', 1)$	?	$u_{1}^{n} (1, i', 2^{n L_{3}})$	?	$u_{1}^{n} (1, 2^{n L_{12}}, 1)$	?	$u_{1}^{n} (1, 2^{n L_{12}}, 2^{n L_{3}})$	bin(1)
$u_{1}^{n} (i, 1, 1)$	?	$u_{1}^{n} (i, 1, 2^{n L_{3}})$	?	$u_{1}^{n} (i, i', 1)$	?	$u_{1}^{n} (i, i', 2^{n L_{3}})$	?	$u_{1}^{n} (i, 2^{n L_{12}}, 1)$	?	$u_{1}^{n} (i, 2^{n L_{12}}, 2^{n L_{3}})$	bin(i)
	$⋮$		$⋮$		$⋮$		$⋮$		$⋮$		$⋮$
$u_{1}^{n} (2^{n L_{11}}, 1, 1)$	?	$u_{1}^{n} (2^{n L_{11}}, 1, 2^{n L_{3}})$	?	$u_{1}^{n} (2^{n L_{11}}, i', 1)$	?	$u_{1}^{n} (2^{n L_{11}}, i', 2^{n L_{3}})$	?	$u_{1}^{n} (2^{n L_{11}}, 2^{n L_{12}}, 1)$	?	$u_{1}^{n} (2^{n L_{11}}, 2^{n L_{12}}, 2^{n L_{3}})$	$b i n (2^{n L_{11}})$

表1

参考文献 25

[1]	LIANG Y , POOR H V , SHAMAI S . Information theory security[J]. Foundations and Trends in Communication and Informatio Theory, 2009,5(4-5): 2009.355-580.
[2]	CSISZAR I , KORNER J . Broadcast channels with confidential mes-sages[J]. IEEE Transactions on Information Theory, 1978,24(3): 339-348.
[3]	TANDON R , SANKAR L , POOR H V . Multi-user privacy:the Gray-Wyner system and generalized common information[A]. Proc IEEE International Symposium on Information Theory[C]. Saint-Petersburg,Russia, 2011. 563-567.
[4]	VILLARD J , PIANTANIDA P , SHAMAI S . Secure lossy sourcechannel wiretapping with side information at the receiving termin-als[A]. IEEE International Symposium on Information Theory[C]. Saint-Petersburg,Russia, 2011. 1141-1145.
[5]	WYREMBELSKI R F , BOCHE H . Strong secrecy in compound broadcast channels with confidential messages[A]. IEEE International Symposium on Information Theory[C]. Cambridge,MA,USA, 2012. 76-80.
[6]	CZAP L , PRABHAKARAN V M , DIGGAVI S . Broadcasting private messages securely[A]. IEEE International Symposium on nformation Theory[C]. Cambridge,MA,USA, 2012. 428-432.
[7]	LY H D , LIU T , LIANG Y . Multiple-input multiple-output Gaussian broadcast channels with common and confidential messages[J]. IEEE Transactions on Information Theory, 2010,56(11): 5477-5487.
[8]	KHISTI A , LIU T . On private broadcasting over independent parallel channels[A]. IEEE International Symposium on Information Theory[C]. Cambridge,MA,USA, 2012. 433-437.
[9]	LIU R , MARIC I , SPASOJEVIC P ,et al. Discrete memoryless interference and broadcast channels with confidential messa :secrecy rate regions[J]. IEEE Transactions on Information Theory, 2008,54(6): 2493-2507.
[10]	XU J , CAO Y , CHEN B . Capacity bounds for broadcast cha nels with confidential messages[J]. IEEE Transactions on Information Theory, 2009,55(10): 4529-4542.
[11]	KRAMER G . Topic in multi-user information theory[J]. Foundations and Trends in Communication and Information Theory, 2008,4(4-5): 265-444.
[12]	GRAY R , WYNER A . Source coding for a simple network[J]. Bell System Technical Journal, 1974,53(9): 1681-1721.
[13]	TIMO R , GRANT A , CHAN T ,et al. Source coding for a simple network with receiver side information[A]. Proc IEEE I ternational Symposium on Information Theory[C]. Toronto,Canada, 2008. 2307-2311.
[14]	KAMATH S , ANANTHARAM V . A new dual to the Gács-K?rner common information defined via the Gray-Wyner system[A]. Conference on Communication,Control,and Computing (Allerton)[C]. Monticello,USA, 2010. 1340-1346.
[15]	HAN T S , COSTA M H M . Broadcast channels with arbitrar ly correlated sources[J]. IEEE Transactions on Information Theory, 1987,33(5): 641-650.
[16]	TUNCEL E . Slepian-Wolf coding over broadcast channels[J]. IEEE Transactions on Information Theory, 2006,52(4): 1469-1482.
[17]	KANG W , KRAMER G . Broadcast channel with degraded source random variables and receiver side information[A]. Proc IEEE International Symposium on Information Theory[C]. Toronto,Canada, 2008. 1711-1715.
[18]	MINERO P , KIM Y H . Correlated sources over broadcast c nels[A]. IEEE International Symposium on Information Theory[C]. Seoul,Korea, 2009. 2780-2784.
[19]	MURIN Y , DABORA R , GUNDUZ D . Joint source-channel coding for the multiple-access relay channel[A]. IEEE International Symposium on Information Theory[C]. 2012. 1937-1941.
[20]	YANG Z , ZHAO S , MA X ,et al. A new joint source-channel coding scheme based on nested lattice codes[J]. IEEE Communications Letters, 2012,16(5): 730-733.
[21]	GUNDUZ D , ERKIP E , GOLDSMITH A ,et al. Reliable joint source-channel cooperative transmission over relay networks[J]. IEEE Transactions on Information Theory, 2013,59(4): 2442-2458.
[22]	LIU N , GUNDUZ D , GOLDSMITH A J . Interference channels ith correlated receiver side information[J]. IEEE Transact ns on Information Theory, 2010,56(12): 5984-5999.
[23]	GAMAL A E , KIM Y H . Network Information Theory[M]. Cambridge University Press, 2011.
[24]	COVER T , THOMAS J . Elements of Information Theory[M]. New York: Wiley, 2006.
[25]	GEL'FAND S I , PINSKER M S . Capacity of a broadcast channel with one deterministic component[J]. Problems of Information Transmission, 1980,16(1): 17-25.

基于分离信源信道码的相关信源在有噪广播信道下的可靠和安全传输

Secure lossless transmission of correlated sources over noisy broadcast channel using separate source-channel coding

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 3

参考文献 25

相关文章 6

Metrics

推荐阅读 0

[1]	任品毅,许茜. 基于移动边缘计算的时延能耗最小化安全传输[J]. 通信学报, 2020, 41(11): 52-63.
[2]	张小卉,张顺亮,李博文. 适用于保密容量为负情形的基于混沌序列的polar码加密方案[J]. 通信学报, 2020, 41(10): 130-138.
[3]	张波,黄开枝,钟州,陈亚军. 异构携能通信网络中人工噪声辅助的顽健能量与信息安全传输方案[J]. 通信学报, 2019, 40(3): 60-72.
[4]	郎非1，王保云1,2，邓志祥1. 基于分离信源信道码的相关信源在有噪广播信道下的可靠和安全传输[J]. 通信学报, 2013, 34(10): 3-27.
[5]	李勇,王文博,孔佳,彭木根. 新的半双工中继协议及其资源分配[J]. 通信学报, 2009, 30(5): 9-15.
[6]	潘成康,蔡跃明,徐友云,张华平. 获取高斯MIMO广播信道和容量域的一种方法[J]. 通信学报, 2006, 27(1): 52-58.