The Dissemination of Chinese Tea Culture Based on Encoding/Decoding Theory

Tea has a history of thousands of years in China and it plays an important role in the working-life and daily life of people.Tea culture rich in connotation is an important part of Chinese traditional culture,and its existence and development are also of great significance to the diversified development of world culture.Based on Stuart Hall’s encoding/decoding theory,this paper analyzes the problems in the spreading of Chinese tea in and out of the country and provides solutions from the perspective of encoding,communication,and decoding.It is expected to provide a reference for the domestic and international dissemination of Chinese tea culture.

The Dissemination of Intangible Cultural Heritage Along Beijing-Hangzhou Canal Based on Encoding/Decoding Theory

The Beijing-Hangzhou Grand Canal carries a wealth of Chinese cultural symbols,showing the lifestyle and wisdom of working people through ages.The preservation and inheritance of its intangible cultural heritage can help to evoke cultural memories and cultural identification of the Canal and build cultural confidence.This paper applies Stuart Hall’s encoding/decoding theory to analyze the dissemination of intangible heritage tourism culture.On the basis of a practical study of the villages along the Beijing-Hangzhou Grand Canal,this paper analyses the problems in the transmission of its intangible cultural heritage and proposes specific methods to solve them in four processes,encoding,decoding,communication,and secondary encoding,in order to propose references for the transmission of intangible heritage culture at home and abroad.

Novel joint encoding/decoding algorithms of fountain codes for underwater acoustic communication

Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.

A highly reliable encoding and decoding communication framework based on semantic information

Increasing research has focused on semantic communication,the goal of which is to convey accurately the meaning instead of transmitting symbols from the sender to the receiver.In this paper,we design a novel encoding and decoding semantic communication framework,which adopts the semantic information and the contextual correlations between items to optimize the performance of a communication system over various channels.On the sender side,the average semantic loss caused by the wrong detection is defined,and a semantic source encoding strategy is developed to minimize the average semantic loss.To further improve communication reliability,a decoding strategy that utilizes the semantic and the context information to recover messages is proposed in the receiver.Extensive simulation results validate the superior performance of our strategies over state-of-the-art semantic coding and decoding policies on different communication channels.

A Denoiser for Correlated Noise Channel Decoding: Gated-Neural Network

This letter proposes a sliced-gated-convolutional neural network with belief propagation(SGCNN-BP) architecture for decoding long codes under correlated noise. The basic idea of SGCNNBP is using Neural Networks(NN) to transform the correlated noise into white noise, setting up the optimal condition for a standard BP decoder that takes the output from the NN. A gate-controlled neuron is used to regulate information flow and an optional operation—slicing is adopted to reduce parameters and lower training complexity. Simulation results show that SGCNN-BP has much better performance(with the largest gap being 5dB improvement) than a single BP decoder and achieves a nearly 1dB improvement compared to Fully Convolutional Networks(FCN).

Variational data encoding and correlations in quantum-enhanced machine learning

Leveraging the extraordinary phenomena of quantum superposition and quantum correlation,quantum computing offers unprecedented potential for addressing challenges beyond the reach of classical computers.This paper tackles two pivotal challenges in the realm of quantum computing:firstly,the development of an effective encoding protocol for translating classical data into quantum states,a critical step for any quantum computation.Different encoding strategies can significantly influence quantum computer performance.Secondly,we address the need to counteract the inevitable noise that can hinder quantum acceleration.Our primary contribution is the introduction of a novel variational data encoding method,grounded in quantum regression algorithm models.By adapting the learning concept from machine learning,we render data encoding a learnable process.This allowed us to study the role of quantum correlation in data encoding.Through numerical simulations of various regression tasks,we demonstrate the efficacy of our variational data encoding,particularly post-learning from instructional data.Moreover,we delve into the role of quantum correlation in enhancing task performance,especially in noisy environments.Our findings underscore the critical role of quantum correlation in not only bolstering performance but also in mitigating noise interference,thus advancing the frontier of quantum computing.

A novel encoding mechanism for particle physics

This study proposes a novel particle encoding mechanism that seamlessly incorporates the quantum properties of particles,with a specific emphasis on constituent quarks.The primary objective of this mechanism is to facilitate the digital registration and identification of a wide range of particle information.Its design ensures easy integration with different event generators and digital simulations commonly used in high-energy experiments.Moreover,this innovative framework can be easily expanded to encode complex multi-quark states comprising up to nine valence quarks and accommodating an angular momentum of up to 99/2.This versatility and scalability make it a valuable tool.

Improved Segmented Belief Propagation List Decoding for Polar Codes with Bit-Flipping

Belief propagation list(BPL) decoding for polar codes has attracted more attention due to its inherent parallel nature. However, a large gap still exists with CRC-aided SCL(CA-SCL) decoding.In this work, an improved segmented belief propagation list decoding based on bit flipping(SBPL-BF) is proposed. On the one hand, the proposed algorithm makes use of the cooperative characteristic in BPL decoding such that the codeword is decoded in different BP decoders. Based on this characteristic, the unreliable bits for flipping could be split into multiple subblocks and could be flipped in different decoders simultaneously. On the other hand, a more flexible and effective processing strategy for the priori information of the unfrozen bits that do not need to be flipped is designed to improve the decoding convergence. In addition, this is the first proposal in BPL decoding which jointly optimizes the bit flipping of the information bits and the code bits. In particular, for bit flipping of the code bits, a H-matrix aided bit-flipping algorithm is designed to enhance the accuracy in identifying erroneous code bits. The simulation results show that the proposed algorithm significantly improves the errorcorrection performance of BPL decoding for medium and long codes. It is more than 0.25 d B better than the state-of-the-art BPL decoding at a block error rate(BLER) of 10^(-5), and outperforms CA-SCL decoding in the low signal-to-noise(SNR) region for(1024, 0.5)polar codes.

A Two-Layer Encoding Learning Swarm Optimizer Based on Frequent Itemsets for Sparse Large-Scale Multi-Objective Optimization

Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero.As a result,many algorithms use a two-layer encoding approach to optimize binary variable Mask and real variable Dec separately.Nevertheless,existing optimizers often focus on locating non-zero variable posi-tions to optimize the binary variables Mask.However,approxi-mating the sparse distribution of real Pareto optimal solutions does not necessarily mean that the objective function is optimized.In data mining,it is common to mine frequent itemsets appear-ing together in a dataset to reveal the correlation between data.Inspired by this,we propose a novel two-layer encoding learning swarm optimizer based on frequent itemsets(TELSO)to address these SLMOPs.TELSO mined the frequent terms of multiple particles with better target values to find mask combinations that can obtain better objective values for fast convergence.Experi-mental results on five real-world problems and eight benchmark sets demonstrate that TELSO outperforms existing state-of-the-art sparse large-scale multi-objective evolutionary algorithms(SLMOEAs)in terms of performance and convergence speed.

The"Decoding Zhonghua"International Conference on Dialogue among Civilisations Held in Beijing

The"Decoding Zhonghua"International Conference on Dialogue among Civilisations,hosted by China International Public Relations Association,China Ethnic News and Academy of Contemporary China and World Studies was held in Beijing on January 17th.With the theme"Pursing Harmonious Coexistence of Civilisations through Dialogue".

On the Manipulation of the Selectivity of Encoding and Decoding overthe Translator's Subjectivity

The translation activity is a process of the interlinguistic transmission of information realized by the information encoding and decoding.Encoding and decoding,cognitive practices operated in objective contexts,are inevitably of selectivity ascribing to the restriction of contextual reasons.The translator as the intermediary agent connects the original author(encoder)and the target readers(decoder),shouldering the dual duties of the decoder and the encoder,for which his subjectivity is irrevocably manipulated by the selectivity of encoding and decoding.

Brain Encoding and Decoding in fMRI with Bidirectional Deep Generative Models

Brain encoding and decoding via functional magnetic resonance imaging(fMRI)are two important aspects of visual perception neuroscience.Although previous researchers have made significant advances in brain encoding and decoding models,existing methods still require improvement using advanced machine learning techniques.For example,traditional methods usually build the encoding and decoding models separately,and are prone to overfitting on a small dataset.In fact,effectively unifying the encoding and decoding procedures may allow for more accurate predictions.In this paper,we first review the existing encoding and decoding methods and discuss the potential advantages of a“bidirectional”modeling strategy.Next,we show that there are correspondences between deep neural networks and human visual streams in terms of the architecture and computational rules.Furthermore,deep generative models(e.g.,variational autoencoders(VAEs)and generative adversarial networks(GANs))have produced promising results in studies on brain encoding and decoding.Finally,we propose that the dual learning method,which was originally designed for machine translation tasks,could help to improve the performance of encoding and decoding models by leveraging large-scale unpaired data.

Encoding-Decoding-Based Control and Filtering of Networked Systems： Insights, Developments and Opportunities

In order to make the information transmission more efficient and reliable in a digital communication channel with limited capacity, various encoding-decoding techniques have been proposed and widely applied in many branches of the signal processing including digital communications, data compression,information encryption, etc. Recently, due to its promising application potentials in the networked systems(NSs), the analysis and synthesis issues of the NSs under various encoding-decoding schemes have stirred some research attention. However, because of the network-enhanced complexity caused by the limited network resources, it poses new challenges to the design of suitable encoding-decoding procedures to meet certain control or filtering performance for the NSs. In this survey paper, our aim is to present a comprehensive review of the encoding-decodingbased control and filtering problems for different types of NSs.First, some basic introduction with respect to the coding-decoding mechanism is presented in terms of its engineering insights,specific properties and theoretical formulations. Then, the recent representative research progress in the design of the encodingdecoding protocols for various control and filtering problems is discussed. Some possible further research topics are finally outlined for the encoding-decoding-based NSs.

JOINT ITERATIVE DECODING FOR SIMPLE-ENCODING SYSTEMATIC IRREGULAR-LDPC-BASED CODED COOPERATION IN NON-IDEAL RELAY CHANNEL

In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.

Underwater Object Recognition Based on Deep Encoding-Decoding Network

Ocean underwater exploration is a part of oceanography that investigates the physical and biological conditions for scientific and commercial purposes. And video technology plays an important role and is extensively applied for underwater environment observation. Different from the conventional methods, video technology explores the underwater ecosystem continuously and non-invasively. However, due to the scattering and attenuation of light transport in the water, complex noise distribution and lowlight condition cause challenges for underwater video applications including object detection and recognition. In this paper, we propose a new deep encoding-decoding convolutional architecture for underwater object recognition. It uses the deep encoding-decoding network for extracting the discriminative features from the noisy low-light underwater images. To create the deconvolutional layers for classification, we apply the deconvolution kernel with a matched feature map, instead of full connection, to solve the problem of dimension disaster and low accuracy. Moreover, we introduce data augmentation and transfer learning technologies to solve the problem of data starvation. For experiments, we investigated the public datasets with our proposed method and the state-of-the-art methods. The results show that our work achieves significant accuracy. This work provides new underwater technologies applied for ocean exploration.

Encoding-Decoding-Based Recursive Filtering for Fractional-Order Systems

Dear editor,This letter focuses on the encoding-decoding-based recursive filtering problem for a class of fractional-order systems.For the purpose of protecting security of the wireless communication network,a dynamic-quantization-based encoding-decoding mechanism is introduced to encrypt the transmitted measurement.Specifically,the measurement outputs are first encoded by the encoder into codewords which are then transmitted over the wireless communication network.After received by the decoder,the codewords are decoded and then sent to the filter.In light of the mathematical properties of truncated Gaussian distribution,the variance of the encoding-decoding-induced error between the decoded measurement and the real measurement is derived.An upper bound on the filtering error covariance is first obtained based on the variance of the encoding-decoding-induced error.Then,the minimal upper bound is derived by choosing proper filter gain.Finally,the efficiency and superiority of the proposed algorithm are verified through a simulation example.

Encoding-decoding message for secure communication based on adaptive chaos synchronization

In this paper, based on an adaptive chaos synchronization scheme, two methods of encoding-decoding message for secure communication are proposed. With the first method, message is directly added to the chaotic signal with parameter uncertainty. In the second method, multi-parameter modulation is used to simultaneously transmit more than one digital message （i.e., the multichannel digital communication） through just a single signal, which switches among various chaotic attractors that differ only subtly. In theory, such a treatment increases the difficulty for the intruder to directly intercept the information, and meanwhile the implementation cost decreases significantly. In addition, numerical results show the methods are robust against weak noise, which implies their practicability.

Research on encoding and decoding of non-binary polar codes over GF(2m)

Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.

Improved encoding structure and decoding algorithms for spinal codes

To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for spinal codes is proposed. In the A-FSD algorithm, a flexible threshold parameter is set by a variable channel state to narrow the scale of nodes accessed. On this basis, a new decoding method of AFSD with early termination(AFSD-ET) is further proposed. The AFSD-ET decoder not only has the ability of dynamically modifying the number of stored nodes, but also adopts the early termination criterion to curtail complexity. The complexity and related parameters are verified through a series of simulations. The simulation results show that the proposed spinal codes with tail-biting and the AFSD-ET decoding algorithms can reduce the complexity and improve the decoding rate without sacrificing correct decoding performance.

THE UNIFICATION OF DIFFERENTIAL ENCODING AND DECODING ALGORITHM FOR VARIOUS SIGNALS

Many monographs point out that differential encoding and decoding is necessary for ef- fectual information transmission against phase ambiguity while seldom discuss the reason why phase ambiguity will emerge inevitably.Available algorithms are specially designed for certain modulation scheme;these algorithms cannot satisfy the requirement of soft-defined radio,which perhaps demands a uniform algorithm for different modulations.This paper proposes a new opinion on phase ambiguity from the view of probability.This opinion believes that modulating symbol sequence can affect,at optimum sampling epoch,the modulated waveform as oscillating carrier has done,and so the stochastic sequence leads to phase ambiguity.Based on a general signal model,this paper also puts forward a novel universal algorithm,which is suitable for different signals,even some new ones,by configuring several parameters.