|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | On Random Linear Network Coding for Butterfly Network显示文摘 | GUANG Xuan FU Fangwei | 2011 | Chinese Journal of Electronics2011，20，2： | 3 |
| 2 | Linear recurring sequences and subfield subcodes of cyclic codes显示文摘Linear recurring sequences over finite fields play an important role in coding theory and cryptography. It is known that subfield subcodes of linear codes yield some good codes. In this paper, we study linear recurring sequences and subfield subcodes. Let Mqm(f(x)) denote the set of all linear recurring sequences over Fqm with characteristic polynomial f(x) over Fqm . Denote the restriction of Mqm(f(x)) to sequences over Fq and the set after applying trace function to each sequence in Mqm(f(x)) by Mqm(f(x)) | Fq and Tr( Mqm(f(x))), respectively. It is shown that these two sets are both complete sets of linear recurring sequences over Fq with some characteristic polynomials over Fq. In this paper, we firstly determine the characteristic polynomials for these two sets. Then, using these results, we determine the generator polynomials of subfield subcodes and trace codes of cyclic codes over Fqm . | GAO ZhiHan FU FangWei | 2013 | Science China Mathematics2013，56，7： | 2 |
| 3 | Transient eddy-current driver pickup probe response due to a conductive plate 显示文摘 | Fangwei Fu John Bowler | 2006 | IEEE Transactions on magnetics2006，42，8： | 1 |
| 4 | On constant composition codes over Z q显示文摘 | Luo Yuan Fu Fangwei Vinck A J H et aI | 2003 | IEEE Trans Inf Theory2003，49，11： | 1 |
| 5 | Transient eddy-current driver pickup probe response due to a conductive plate 显示文摘 | Fu Fangwei Bowler J | 2006 | IEEE Transactions on Magnetics2006，42，8： | 1 |
| 6 | Construc?tions of permutation arrays显示文摘 | Ding Cunsheng Fu Fangwei Klove T et aI | 2002 | IEEE Trans Inf Theory2002，48，97： | 1 |
| 7 | Transient eddy-current driver pickup probe response due to a conductive plate显示文摘 | Fu Fangwei Bowler J | 2006 | IEEE Transactions on Magnetics2006，42，8： | 1 |
| 8 | The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence显示文摘 | GAO ZHIHAN FU FANGWEI | 2010 | Theoretical Computer Science2010，，411： | 1 |
| 9 | On the Nonpefiodic Cyclic Equivalence Classes of Hanmming Codes and BCH Codes 显示文摘 | Fu Fangwei Shen Shiyi | 2001 | Journal of Statistical Planning and Inference2001，94，2： | 1 |
| 10 | A New Class of p-Ary Sequence Families with Low Correlation Property via m-Sequence显示文摘For an odd prime p which is congruent to 3 module 4 and an odd integer k,we investigate the upper bound on the magnitude of cross correlation values of a p-ary m-sequence s(t) and its decimated sequences s(dt + l) for a decimation value d.Using the above upper bound of the magnitude of cross correlation values of pary m-sequence and its decimated sequences,we construct a new class of p-ary sequence families with low correlation property via m-sequence. | REN Wenli FU Fangwei | 2016 | Chinese Journal of Electronics2016，25，4： | 1 |
| 11 | The expectation and variance of the joint linear complexity of random periodic multisequences 显示文摘 | Fu Fangwei Niederreiter H Su Ming | 2005 | J Complexity2005，21，6： | 1 |
| 12 | On the Construction of New Resilient Functions from Old Ones显示文摘 | Chen Lusheng Fu Fangwei | 1999 | IEEE Trans Inform Theory1999，45，6： | 1 |
| 13 | Transient eddy current driver pickup probe response due to a conductive plate 显示文摘 | Fangwei Fu John LMwler | 2006 | IEEE Transactions on Magnetics2006，12，8： | 1 |
| 14 | Construction of compressed sensing matrices based on affine symplectic space over finite fields显示文摘The compressed sensing matrices based on affine symplectic space are constructed. Meanwhile, a comparison is made with the compressed sensing matrices constructed by DeVore based on polynomials over finite fields. Moreover, we merge our binary matrices with other low coherence matrices such as Hadamard matrices and discrete fourier transform(DFT) matrices using the embedding operation. In the numerical simulations, our matrices and modified matrices are superior to Gaussian matrices and DeVore's matrices in the performance of recovering original signals. | Wang Gang Niu Minyao Fu Fangwei | 2018 | The Journal of China Universities of Posts and Telecommunications2018，25，6： | 0 |
| 15 | STRONG CODING THEOREM AND ASYMPTOTICERROR EXPONENT OF ARBITRARILY VARYING SOURCE WITH A FIDELITY CRITERION显示文摘When the error probability is less than 2--'', the minimum compression rate(r-optimal rate) of arbitrarily varying source with a fidelity criterion is determined. Thisgeneralizes the result of Arutyunyan and Mekaushll] for discrete memoryless source witha fidelity criterion, and is called strong coding theorem of arbitrarily varying source witha fidelity criterion. We also determine the asymptotic error exponellt for arbitrarily varying source with a fidelity criterion. This generalizes Marton’s result in [2] for discretememoryless source with a fidelity criterion. | FU Fangwei SHEN Shiyi(Department Of Mathematics, Nankai University, Tiawtn 300071, China) | 1998 | Systems Science and Mathematical Sciences1998，11，2： | 0 |
| 16 | ON THE MEAN VALUE AND VARIANCE OF DISTANCE DISTRIBUTION OF NON-LINEAR CODES IN GF(q)显示文摘This paper presents the lower bounds and upper bounds for the mean value and variance of distance distribution of non-linear codes in GF(q). By presenting several examples, it is shown that these bounds could be achieved. | Fu Fangwei Shen Shiyi(Department of Mathematics, Nankai University, Tianjin 300071) | 1998 | Journal of Electronics(China)1998，15，1： | 0 |
| 17 | Hypothesis Testing for Arbitrarily Varying Source | Fu Fangwei Shen Shiyi Department of Mathematics Nankai University Tianjin, 300071 China | 1996 | Acta Mathematica Sinica,English Series1996，12，1： | 0 |
| 18 | The existence and synchronization properties of symmetric fix-free codes显示文摘Fix-free codes are a type of variable length codes with both prefix-free and suffix-free properties, and there are two types of fix-free codes: symmetric fix-free codes and asymmetric fix-free codes. In this paper, we mainly discuss symmetric fix-free codes. First, the existence of symmetric fix-free codes is studied in detail, and some necessary and sufficient conditions are proposed. We also discuss the problem of achieving synchronization of symmetric fix-free codes, which is important in application. We then establish a scheme with synchronizing codewords to resolve this problem. | GUANG Xuan FU FangWei CHEN LuSheng | 2013 | Science China(Information Sciences)2013，56，9： | 0 |
| 19 | On the Construction of Nonlinear Zigzag Functions显示文摘 | YUE Tinghai CHEN Lusheng FU Fangwei | 2007 | Chinese Journal of Electronics2007，16，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员