期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
一种新的OCDMA二维码字结构及其实现方法 被引量:3
1
作者 辛雨 余重秀 +2 位作者 吴强 郑文潇 刘刚 《光通信研究》 北大核心 2003年第3期25-28,共4页
以一维 EQC码为例 ,研究了“不同时片不同波长”的二维码字结构的特点 ,分析了实现这种二维码字编码的光纤光栅编解码技术及其特点 ,并叙述了实现这种
关键词 OCDMA EQC 二维码字结构 光纤光栅 分多址 光纤通信 多比特率编
下载PDF
一种OCDMA二维码字结构及光纤光栅编/解码器 被引量:9
2
作者 辛雨 余重秀 +2 位作者 吴强 忻向军 郑文潇 《光电子.激光》 EI CAS CSCD 北大核心 2003年第5期512-514,共3页
在一维扩展二次同余(EQC)码的基础上,设计了研究量非常大的"不同时片不同波长"的二维码字,进而提出了光纤光栅(FBG)阵列编解码器。该编解码器具有编解码简单、不需要同步信号和能够实现多比特率编码等优点。
关键词 OCDMA 分多址 二维码字 光纤光栅 编/解 多比特率编 扩展次同余 光纤通信
原文传递
2D-ball simulations on stiffness influences for coal bump 被引量:1
3
作者 TAN Yun-liang SUN Chun-jiang ZHANG Zhen-yu 《Journal of Coal Science & Engineering(China)》 2009年第2期161-165,共5页
Coal bump is a dynamic process,thus it is necessary to reveal the process validly.2D-ball code is an efficient approach developed by the authors based on the basicDEM rationale proposed by Cundall.Numerical simulation... Coal bump is a dynamic process,thus it is necessary to reveal the process validly.2D-ball code is an efficient approach developed by the authors based on the basicDEM rationale proposed by Cundall.Numerical simulations show that the coal bump experiencesa process of energy accumulation,sudden release of energy and energy decrease.The stiffness of coal particles has a great influence on the coal bump morphosisand particle velocity.Generally,the larger the stiffness of particles,the longer the shootingoff period and the larger the bump velocity.This is in agreement with the results of laboratoryexperiment and in-situ studies.However,the stiffness of particles has an influence onthe quantity value energy and no influence on the releasing energy pattern of the coalbump. 展开更多
关键词 2D-ball code coal bump stiffness of particle simulation
下载PDF
ON THE SECOND GREEDY WEIGHT FOR LINEAR CODES SATISFYING THE FULLRANK CONDITION
4
作者 CHENWende KLOVETorleiv 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2005年第1期55-66,共12页
The maximum of g2-d2 for linear [n, k, d; q] codes C is studied. Here d2 is the smallest size of the support of 2-dimensional subcodes of C and g2 is the smallest size of the support of 2-dimensional subcodes of C whi... The maximum of g2-d2 for linear [n, k, d; q] codes C is studied. Here d2 is the smallest size of the support of 2-dimensional subcodes of C and g2 is the smallest size of the support of 2-dimensional subcodes of C which contains a codeword of weight d. The extra cost to the greedy adversary to get two symbols of information using some algorithm is g2-d2. For codes satisfying the fullrank condition of general dimensions, upper bounds on the maximum of g2-d2 are given. Under some condition we have got code C where g2-d2 reaches the upper bound. 展开更多
关键词 greedy weight linear code BOUNDS
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部