Now showing items 1-10 of 10

    • Guessing with lies 

      Arıkan, Erdal; Boztaş, S. (IEEE, 2002-06-07)
      A practical algorithm was obtained for directly generating an optimal guessing sequence for guessing under lies. An optimal guessing strategy was defined as one which minimizes the number of average number of guesses in ...
    • Hardware implementation of fano decoder for polarization-adjusted convolutional (PAC) codes 

      Mozammel, Amir (IEEE, 2021-10-26)
      This brief proposes a hardware implementation architecture for Fano decoding of polarization-adjusted convolutional (PAC) codes. This architecture uses a novel branch metric unit specific to PAC codes. The proposed decoder ...
    • Hardware implementation of Fano Decoder for polarization-adjusted convolutional (PAC) codes 

      Hokmabadi, Amir Mozammel (Bilkent University, 2022-06)
      Polarization-adjusted convolutional (PAC) codes are a new class of error-correcting codes that have been shown to achieve near-optimum performance. By combining ideas from channel polarization and convolutional coding, PAC ...
    • Joint source-channel coding and guessing with application to sequential decoding 

      Arikan, E.; Merhav, N. (Institute of Electrical and Electronics Engineers, 1998-09)
      We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct ...
    • Lower bounds to moments of list size 

      Arıkan, Erdal (IEEE, 1990)
      Summary form only given. The list-size random variable L for a block code is defined as the number of incorrect messages that appear to a maximum-likelihood decoder to be at least as likely as the true message. Lower bounds ...
    • On sequential decoding metric function of polarization-adjusted convolutional (PAC) codes 

      Moradi, Mohsen (IEEE, 2021-09-07)
      In this paper, we present a sequential decoding metric function, which leads to significantly improved computational complexity while maintaining the superiority of polarizationadjusted convolutional (PAC) codes’ ...
    • On the origin of polar coding 

      Arıkan, E. (Institute of Electrical and Electronics Engineers Inc., 2016)
      Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a ...
    • Performance and computational analysis of polarization-adjusted convolutional (PAC) codes 

      Moradi, Mohsen (Bilkent University, 2022-06)
      We study the performance of sequential decoding of polarization-adjusted con- volutional (PAC) codes. We present a metric function that employs bit-channel mutual information and cutoff rate values as the bias values and ...
    • Sequential decoding on intersymbol interference channels with application to magnetic recording 

      Alanyalı, Murat (Bilkent University, 1990)
      In this work we treat sequential decoding in the problem of sequence estimation on intersymbol interference ( ISI ) channels. We consider the magnetic recording channel as the particular ISI channel and investigate the ...
    • Trellis coding for high signal-to-noise ratio Gaussian noise channels 

      Arıkan, Erdal (IEEE, 1989)
      It is known that under energy constraints it is best to have each code word of a code satisfy the constraint with equality, rather than have the constraint satisfied only in an average sense over all code words. This ...