Kasno Atmo Sukarto, Septriana Parlianti · Zenodo (CERN European Organization for Nuclear Research) · 2023
The aim of this study is to describe the form of code switching, code mixing and the factors that cause code switching and code mixing. The data was taken from several Korean YouTube channel Reomit videos. Reomit's Korean YouTube channel is owned by Jang Hansol. He is a Korean citizen who can speak Indonesian, Korean, English, and Javanese. This research used qualitative descriptive method and the data collection uses a non-participatory conversational observation method. In data analysis, the researcher classified the data based on linguistic elements and described it using Hymes' theory. The result of this research is, the researcher found two types of code switching, namely internal code switching and external code switching. Then, the it found two types of code mixing, namely internal code mixing and external code mixing. The code switching that occurs is code switching from Indonesian to Korean, code switching from Indonesian to English, and code switching from Javanese to Indonesian. Furthermore, the code mixing that occurs is an element of English interpolation, an element of Korean interpolation, and an interpolation of Javanese. In addition, the factors that cause code switching and code mixing are to be prestigious, the speaker, the background of the speaker, the third person present, the listener, and the limitations of the code used.
Cited by 2Open access
Xiao, Yuan, Chen, Yuchen, Ma, Shiqing et al. · arXiv (Cornell University) · 2025
Watermarking is a technique to help identify the source of data points, which can be used to help prevent the misuse of protected datasets. Existing methods on code watermarking, leveraging the idea from the backdoor research, embed stealthy triggers as watermarks. Despite their high resilience against dilution attacks and backdoor detections, the robustness has not been fully evaluated. To fill this gap, we propose DeCoMa, a dual-channel approach to Detect and purify Code dataset waterMarks. To overcome the high barrier created by the stealthy and hidden nature of code watermarks, DeCoMa leverages dual-channel constraints on code to generalize and map code samples into standardized templates. Subsequently, DeCoMa extracts hidden watermarks by identifying outlier associations between paired elements within the standardized templates. Finally, DeCoMa purifies the watermarked dataset by removing all samples containing the detected watermark, enabling the silent appropriation of protected code. We conduct extensive experiments to evaluate the effectiveness and efficiency of DeCoMa, covering 14 types of code watermarks and 3 representative intelligent code tasks (a total of 14 scenarios). Experimental results demonstrate that DeCoMa achieves a stable recall of 100% in 14 code watermark detection scenarios, significantly outperforming the baselines. Additionally, DeCoMa effectively attacks code watermarks with embedding rates as low as 0.1%, while maintaining comparable model performance after training on the purified dataset. Furthermore, as DeCoMa requires no model training for detection, it achieves substantially higher efficiency than all baselines, with a speedup ranging from 31.5 to 130.9X. The results call for more advanced watermarking techniques for code models, while DeCoMa can serve as a baseline for future evaluation. Code is available at https://github.com/xiaoyuanpigo/DeCoMa
Cited by 0Open access
Xiaofeng Tao, Haiyan Qin, Lei Wen et al. · 2004
The theoretic capacity of V-BLAST systems has been shown to be significantly higher than that of single antenna systems in Rayleigh fading channel. This is why research on V-BLAST systems has been a hotspot recently. In an attempt to study V-BLAST systems, a lot researches have been focused on flat fading channel rather than frequency selective fading channel. Aiming at this, a novel channel modeling of V-BLAST systems under frequency selective fading channel is proposed in this paper, extending research of V-BLAST systems from flat fading channel to frequency selective fading channel.
Cited by 6
Hakim Jemaa, Hadi Sarieddeen, Simon Tarboush et al. · 2024
As advancements close the gap between current device capabilities and the requirements for terahertz (THz)-band communications, the demand for terabit-per-second (Tbps) circuits is on the rise. This paper addresses the challenge of achieving Tbps data rates in THz-band communications by focusing on the baseband computation bottleneck. We propose leveraging parallel processing and pseudo-soft information (PSI) across multicarrier THz channels for efficient channel code decoding. We map bits to transmission resources using shorter code-words to enhance parallelizability and reduce complexity. Additionally, we integrate channel state information into PSI to alleviate the processing overhead of soft decoding. Results demonstrate that PSI-aided decoding of 64-bit code-words halves the complexity of 128-bit hard decoding under comparable effective rates, while introducing a 4dB gain at a 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">−3</sup> block error rate. The proposed scheme approximates soft decoding with significant complexity reduction at a graceful performance cost.
Cited by 1
한밭대학교 모바일융합공학과 학생, Yu-Ra Heo, Mina Lee et al. · The Journal of Next-generation Convergence Technology Association · 2023
본 논문에서는 두 개의 톤 간격을 넓게 할당하여 전송하는 SC-BFSK(Split Channel Binary Frequency Shift Keying) 시스템에서 주파수 자원을 효율적으로 사용할 수 있는 확산 코드와 최적의 채널 간격을 찾는 방법 을 제안한다. 제안하는 방법의 송신 신호는 PN(Pseudo Noise) 코드를 사용하여 전송한다. 송신 스펙트럼 관찰 결 과 확산 이득이 큰 경우에는 규칙적인 스펙트럼을 보이지만, 확신 이득이 작은 경우에는 불규칙적인 스펙트럼을 보인다. 확산 코드를 설정한 후 인접 채널 간격을 가변 하면서 간섭에 의한 BER(Bit Error Ratio)을 관찰하여 가 장 작은 BER을 보이는 인접 채널 간격을 찾는다. 모의실험 결과, 확산 이득 별로 최적의 확산 코드가 다르며 인 접 채널 간섭의 영향 또한 다르게 나타난다. 제안하는 확산 이득 별 확산 코드와 인접 채널 간격을 찾는 방법론은 SC-BFSK에서의 통신 성능과 주파수 자원의 문제를 해결할 수 있다.
Cited by 0
Jun Muramatsu · 2013
A stochastic encoder for channel coding is introduced with a rate close to the channel capacity, where the only restriction is that the channel input alphabet is finite. Random numbers, which satisfy a condition specified by a function and its value, are used to construct the stochastic encoder. The proof of the theorem is based on the hash property of an ensemble of functions, where the results are extended to a general channel by deriving an alternative formula for the capacity. Since an ensemble of sparse matrices has a hash property, we can construct a code by using sparse matrices.
Cited by 1
Johnston, Andrew · Zenodo (CERN European Organization for Nuclear Research) · 2022
Data and scripts to analyze beetle diversity on the California Channel Islands
Cited by 2Open access
Fang Liu, Deqiang Wang, Dongfeng Yuan · 2005
In this paper, two kinds of direct sequences are introduced to the channel estimation in DS-UWB system, and applied in the two channel estimation methods named DA (data-aided) channel estimation and NDA (nondata-aided) channel estimation. The BER performances of the MRC Rake receiver with the two sequences are verified and compared via simulations. The simulation results show that ZCD (zero correlation duration) code performs better than Walsh code with DA channel estimation, but Walsh code outperforms ZCD with NDA channel estimation.
Cited by 2
Hirschi, S. · Figshare · 2019
Title of program: COCHASE Catalogue Id: ABIC_v1_0 Nature of problem The computer code COCHASE is designed to calculate the S-matrix in the form of a real phase shift and inelasticity for the interaction of two particles coupled to the possible production of five other two particle channels. The production cross section for each secondary channel is also easily obtained. Versions of this program held in the CPC repository in Mendeley Data ABIC_v1_0; COCHASE; 10.1016/0010-4655(75)90053-3 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)
Cited by 0Open access
M. V. Burnashev · ArXiv.org · 2006
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
Cited by 1Open access
Mita Williams, F.B. Sadler · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1977
The development of the FANG code for performing channel analysis is documented. An input description is provided for users, as well as a brief description of the basic channel theory concepts. A sample streaming problem is described, for which FANG input and output are given.
Cited by 4Open access
Guojun Liao, Lin Zhou, Qiwang Chen et al. · 2023
Compared with the traditional separated source-channel coding model, the performance of the joint source-channel coding will be better in the actual communication system. In addition, the typical decoding algorithms all belong to the algorithms of separated source-channel model. Therefore, the joint coding and decoding algorithm is particularly important and it will be recognized as of great significance in future communication. In this paper, in order to meet the future communication requirements, a scheme of polar code in joint coding is proposed. At the transmitter of the system, the source polarization is constructed by the Bhattacharyya parameter construction method and encoded by non- systematic polar code. For channel polarization, polarization weight construction method is used, which was independent of signal to noise ratio. A joint Belief Propagation (BP) decoder with a simple structure is adopted in the receiver, which includes a channel decoder and a source decoder. The joint decoder performs external iteration only through a few iterations, thus reducing the complexity and improving the efficiency of the communication system. Simulation results show that compared with the channel BP decoder, the performance gain of J-BP decoder is about 1.8dB.
Cited by 1
Minoru Kuribayashi · IEEE Signal Processing Letters · 2018
Robustness against collusion attack has been measured under the marking assumption in fingerprinting codes. However, if codeword symbols are embedded into segments of multimedia content, the assumption must be relaxed. In this letter, we investigate erasures both in segments of multimedia content and in codeword symbols. The former erasure represents the case of a clipping attack, and the latter occurs at the signal-processing domain in which a watermark is embedded. We propose an optimal tracing algorithm under the erasure attack and theoretically estimate the number of erasure symbols in a pirated codeword. To suppress false-positive detections, a cutoff parameter is introduced into the tracing algorithm.
Cited by 3
Zbynek Fedra, Jiří Blumenstein · 2012
This paper deals with an alternative technique to commonly used pilot based training sequence channel estimation for multi-carrier spread-spectrum wireless communication systems. In a system with Code Division Multiple Access (CDMA), the proposed technique exploits one code channel as the training sequence for channel estimation purposes. In a noisy environment, this technique performs better than the pilot based, thanks to the averaging effect of the noise impairment. Simulations are performed using an open VSF-OFCDM simulator developed in Simulink. This is freely available under an academic non-profit license in order to address the common problem of signal processing research where to repeat the work of others is highly demanding or even not possible.
Cited by 0
Andrew Johnston · Zenodo (CERN European Organization for Nuclear Research) · 2024
Data and scripts to analyze beetle diversity on the California Channel Islands
Cited by 0Open access
J.W. Modestino, S.Y. Mui · IRE Transactions on Communications Systems · 1976
The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">E_{b}/N_{0}</tex> parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.
Cited by 91
Bei Zeng · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 2016
Quantum error correction (QEC) is crucial for faithful transmission of quantum information and successful realization of quantum computers. Typically, QEC is designed with minimal assumptions about the noise process, i.e. depolarizing noise that happens independently on each individual particle. In real physical systems, errors are unlikely to be arbitrary. Rather we have reasonable knowledge about the system to model its quantum decoherence process. In this talk, we examine QEC that are adapted to the physical noise models. We start from an overview of the concepts and general methods for channel-adapted QEC. We then examine a technique, called code concatenation, for constructing channel-adapted quantum codes. Applying to the amplitude damping channels, we demonstrate the power of the code concatenation method for constructing good codes for channel-adapted QEC.
Cited by 0
Joseph J. Boutros, Emilio Calvanese Strinati, Albert Guillén i Fàbregas · Cambridge University Engineering Department Publications Database · 2004
Cited by 3
Jun Muramatsu, Shigeki Miyake · IEEE Transactions on Information Theory · 2018
A construction of a channel code by using a source code with decoder side information is introduced. The encoder and decoder pair of any source code can be used for the construction. Constrained-random-number generators, which generate random numbers satisfying a condition specified by a function and its value, are used to construct stochastic encoders and decoders. The result suggests that we can divide the channel coding problem into the problems of channel encoding and source decoding with side information.
Cited by 6Open access
Maharaniguna Yusda, Havid Ardi · English Language and Literature · 2021
In bilingual societies, people are able to speak many languages. Commonly, they mix various languages while doing a conversation. This study aims to find out the type of code-mixing used by Fathia Izzati’s YouTube channel. This research used a theory by Hoffman (1991) about three types of code-mixing. This study is descriptive qualitative research. The data were taken from three videos of YouTube Fathia Izzati in 2018 and 2019. The result shows that from 89 data collected, there are two types out of code-mixing that have been found from three types of Hoffman theory. They are Intra-sentential code-mixing (98.88%), involving a change of pronunciation (1.12%), while intra-lexical code-mixing is not found from the data. By the finding, it can be concluded that the types of code-mixing dominantly used by Fathia in her videos is intra-sentential of code-mixing. The speaker’s educational background and parenting patterns greatly influence her speaking style combining the two languages. The reason Fathia speaks like that because she is comfortable and used to mix two languages when speaking. Sometimes there are Indonesian vocabs that are not match for use when speaking, so the speaker is more comfortable mixing with English vocabs and vice versa. Furthermore, the impact of the personal background of a person influenced the speaker to do code-mixing.
Cited by 0Open access