5 Hits in 3.1 sec

On the strong information singularity of certain stationary processes (Corresp.)

B. Hajek
1979 IEEE Transactions on Information Theory  
One Important consequence is that for a large class of covariance stationary processes the information rate equals that of the process associated with the Browaian motion component of the spectral representation  ...  One of his objectives was to provide a physically meaningful definition of a deterministic process, and to this end he introduced the notion of strong information singularity.  ...  Goppa codes. and quartic extended Goppa codes.  ... 
doi:10.1109/tit.1979.1056088 fatcat:csyuzvumyzbublnquycj4ujefq

Evaluation of correlation parameters for periodic sequences (Corresp.)

M. Pursley, D. Sarwate
1977 IEEE Transactions on Information Theory  
The selection of sets of periodic sequences with good correlation parameters is an important problem in many areas of communication theory. Although algorithms have been proposed  ...  k,i is exact for Barker sequences and for supplying numerical data on the magnitude of the error in this approximation for auto-optimal shifts of m-sequences of period 127.  ...  ACKNOWLEDGMENT The authors wish to thank Mr. H. F. A. Roefs for pointing out that the approximation rk,i = ?  ... 
doi:10.1109/tit.1977.1055734 fatcat:np3nkexnjjgwfizjyhrqikbs54

Optimum linear coding in continuous-time communication systems with noisy side information at the decoder (Corresp.)

T. Basar, T. Basar
1979 IEEE Transactions on Information Theory  
This comes tain a solution for the continuous-time version of the problem from having a codeword with weight two in the dual code. with noisy side information at the receiver and show that our ACKNOWLEDGMENT  ...  There is ing the case when the transmitter can also use the side information, and have shown within this context the optimal linear one exception: Hf (the group for X4+X+ 1) has an extra scheme then achieves  ...  Goppa, " A new class of linear error-correcting codes," Probl. Peredach. Inform., vol. 6, no. 3, pp. 24-30, Sept. 1970. forO<t<T, Fl -, "Rational representation of codes and (L,g) codes," Probl.  ... 
doi:10.1109/tit.1979.1056090 fatcat:shuyth6ymvgxlbpzwl7kxiylim

Transmission and reconstruction of signals using functionally related zero crossings (Ph.D. Thesis abstr.)

F. Marvasti
1975 IEEE Transactions on Information Theory  
It is shown that Goppa codes can be decoded up to their guaranteed capabilities by a simple modification of a Reed-Solomon decoder. Various bounds on the performance of Goppa codes are derived.  ...  A Hamming-like upper bound on the minimum distance of cyclic AN-codes is derived from expressions for the volume of modular arithmetic spheres that are developed in this dissertation.  ... 
doi:10.1109/tit.1975.1055476 fatcat:gh4l445wnjem7dfkfl3lyii7ai

A code-based hybrid signcryption scheme [article]

Jean Belo Klamti, M. Anwar Hasan
2021 arXiv   pre-print
The proposed scheme uses an equivalent subcode as a public code for the receiver, making the NP-completeness of the equivalent subcode problem be one of our main security assumptions.  ...  In this paper, we present a code-based signcryption tag-KEM scheme. We utilize a code-based signature and a CCA2 (adaptive chosen ciphertext attack) secure version of McEliece's encryption scheme.  ...  Van Tilborg, “On the inherent intractability of certain coding problems (corresp.),” IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 384–386, 1978. 3 [14] T. E. Bjørstad and A. W.  ... 
arXiv:2112.07130v1 fatcat:mxx3zwiax5hgticy4llun2pepa