Results 41 to 50 of about 161,015 (210)
On channels and codes for the Lee metric
Information and Control, 1971 Almost all nonbinary codes were designed for the Hamming metric. The Lee metric was defined by Lee in 1958. Golomb and Welch (1968) and Berlekamp (1968) have designed codes for the Lee metric. In this paper, we derive all the discrete, memoryless, symmetric channels matched to the Lee metric, and investigate general properties of Lee metric block codes.
J. Chung-yaw Chiang, Jack K. Wolf
openaire +1 more source
Gaussian channels and the optimal coding
Journal of Multivariate Analysis, 1975 AbstractFor the Gaussian channel Y(t) = Φ(ξ(s), Y(s); s ≦ t) + X(t), the mutual information I(ξ, Y) between the message ξ(·) and the output Y(·) is evaluated, where X(·) is a Gaussian noise. Furthermore, the optimal coding under average power constraints is constructed.
Masuyuki Hitsuda, Shunsuke Ihara
openaire +2 more sources
Joint source-channel coding for image transmission based on best wavelet packet
Tongxin xuebao, 2012 A novel joint source/channel image coding algorithm was proposed based on the best wavelet packet in a rate-distortion sense.Different from other wavelet packet image coding,the channel and the channel code information were introduced to the source ...
Jun-hong CHEN, Qin-yu ZHANG
doaj +2 more sources
Distributed Joint Source-Channel Coding-Based Adaptive Dynamic Network Coding
IEEE Access, 2020 Distributed Source Coding (DSC) schemes rely on separate encoding but joint decoding of statistically dependent sources, which exhibit correlation. More specifically, Distributed Joint Source-Channel coding (DJSC) is associated with the scenario, where ...
Abdulah Jeza Aljohani, Soon Xin Ng
doaj +1 more source
A Network-Coding Aided Road-Map of Large-Scale Near-Capacity Cooperative Communications
IEEE Access, 2018 In the paper, we present a road-map towards a near-capacity large-scale multi-user cooperativecommunications (NLMC) system, where all the evolution paths converge to the construction of the NLMC system.
Hung Viet Nguyen +4 more
doaj +1 more source
Design of superposition polar coding for binary-input less-noisy broadcast channels
ICT Express, 2017 In this study, we design a superposition polar code that can achieve the capacity region of binary-input less-noisy broadcast channels asymptotically. Simulation results show that a better rate region is achievable by superposition polar coding than by ...
Sungik Choi, Sae-Young Chung
doaj +1 more source
Infinite Codes for Memoryless Channels [PDF]
The Annals of Mathematical Statistics, 1959 For a memory less channel with finite input alphabet $A$, finite output alphabet $B$, and probability law $p(b\mid a)$, the capacity $C$ is defined as the maximum over all probability distributions $q$ on $A$ of $$\sum_{ab} q(a)p(b\mid a)\log_2(p(b\mid a)/\sum_a q(a)p(b\mid a)).$$ Shannon [1] has obtained the following result.
openaire +2 more sources
Applied Sciences, 2019 Two schemes are mainly used for coding sounds in cochlear implants: Fixed-Channel and Channel-Picking. This study aims to determine the speech audiometry scores in noise of people using either type of sound coding scheme.
Pierre-Antoine Cucis +5 more
doaj +1 more source
Joint Source-Channel Coding for Multi-Channel Vibrotactile Sensors
IEEE AccessWireless transmission of vibrotactile information holds great promise for immersive Extended Reality (XR) applications, particularly in enabling fine-grained remote manipulation through multi-channel vibrotactile signals.
Tom Ogura +4 more
doaj +1 more source
Convolutional coding for code multiplexing of channels [PDF]
EPJ Web of ConferencesThis paper explores the application of convolutional codes and their extensions in the context of binary channel code division. A novel method for channel division utilizing convolutional coding is presented, alongside a comparative analysis with block ...
Rabin Alexey +2 more
doaj +1 more source