Reliability on QR codes and Reed-Solomon codes

• URL: http://arxiv.org/abs/2407.17364v1
• Date: Wed, 24 Jul 2024 15:41:15 GMT
• Title: Reliability on QR codes and Reed-Solomon codes
• Abstract summary: The study begins by defining a code and explores key outcomes for codes with additional properties, such as linearity. The structure of QR codes is analyzed, encompassing different versions and how data is represented in the form of black and white pixels within an image.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: This study addresses the use of Reed-Solomon error correction codes in QR codes to enhance resilience against failures. To fully grasp this approach, a basic cryptographic context is provided, necessary for understanding Reed-Solomon codes. The study begins by defining a code and explores key outcomes for codes with additional properties, such as linearity. The theoretical framework is further developed with specific definitions and examples of Reed-Solomon codes, presented as a particular variant of BCH codes. Additionally, the structure of QR codes is analyzed, encompassing different versions and how data is represented in the form of black and white pixels within an image. Finally, an inherent vulnerability of Reed-Solomon Codes, and particularly of QR codes, related to selective manipulation of modules is examined. This vulnerability leverages the error correction mechanisms present in Reed-Solomon codes.

Related papers

• ALFA: A Safe-by-Design Approach to Mitigate Quishing Attacks Launched via Fancy QR Codes [2.854810947832689]
  Phishing with Quick Response (QR) codes is termed as Quishing. The attackers exploit this method to manipulate individuals into revealing their confidential data.<n>Recently, we see the colorful and fancy representations of QR codes, the 2D matrix of QR codes which does not reflect a typical mixture of black-white modules anymore.<n>We introduce "ALFA", a safe-by-design approach, to mitigate Quishing and prevent everyone from accessing the post-scan harmful payload of fancy QR codes.
  arXiv  Detail & Related papers  (2026-01-11T03:56:56Z)
• QRïS: A Preemptive Novel Method for Quishing Detection Through Structural Features of QR [3.1186758722870582]
  Cyberattackers embed falsify and misleading information in QR codes to launch various phishing attacks which termed as Quishing.<n>We propose QR"iS, the pioneer method to classify QR codes through the comprehensive structural analysis of a QR code.<n>Our method is clearly transparent which makes it reproducible, scalable, and easy to comprehend.
  arXiv  Detail & Related papers  (2025-10-20T05:30:47Z)
• Is Compression Really Linear with Code Intelligence? [60.123628177110206]
  textitFormat Annealing is a lightweight, transparent training methodology designed to assess the intrinsic capabilities of pre-trained models equitably.<n>Our empirical results reveal a fundamental logarithmic relationship between measured code intelligence and bits-per-character (BPC)<n>Our work provides a more nuanced understanding of compression's role in developing code intelligence and contributes a robust evaluation framework in the code domain.
  arXiv  Detail & Related papers  (2025-05-16T16:59:14Z)
• Iterative Predictor-Critic Code Decoding for Real-World Image Dehazing [30.834087480652194]
  We propose a novel Iterative Predictor-Critic Code Decoding framework for real-world image dehazing, abbreviated as IPC-Dehaze. Our method utilizes high-quality codes obtained in the previous iteration to guide the prediction of the Code-Predictor in the subsequent iteration.
  arXiv  Detail & Related papers  (2025-03-17T13:18:35Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes. We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• Decoding Quantum LDPC Codes using Collaborative Check Node Removal [0.0]
  We present a strategy to improve the performance of the iterative decoders based on a collaborative way. We use the concept of bit separation and generalize it to qubit separation. This gives us a metric to analyze and improve the decoder's performance towards harmful configurations of QLDPC codes.
  arXiv  Detail & Related papers  (2025-01-14T11:41:45Z)
• Collective Bit Flipping-Based Decoding of Quantum LDPC Codes [0.6554326244334866]
  We improve both the error correction performance and decoding latency of variable degree-3 (dv-3) QLDPC codes under iterative decoding. Our decoding scheme is based on applying a modified version of bit flipping (BF) decoding, namely two-bit bit flipping (TBF) decoding.
  arXiv  Detail & Related papers  (2024-06-24T18:51:48Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• A Novel ICD Coding Method Based on Associated and Hierarchical Code Description Distillation [6.524062529847299]
  ICD coding is a challenging multilabel text classification problem due to noisy medical document inputs. Recent advancements in automated ICD coding have enhanced performance by integrating additional data and knowledge bases with the encoding of medical notes and codes. We propose a novel framework based on associated and hierarchical code description distillation (AHDD) for better code representation learning and avoidance of improper code assignment.
  arXiv  Detail & Related papers  (2024-04-17T07:26:23Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Decoding general error correcting codes and the role of complementarity [2.66269503676104]
  We show that a decoding circuit for Calderbank-Shor-Stean (CSS) codes can be straightforwardly extended to that for a general QECC. We then demonstrate the power of the decoding circuit in a toy model of the black hole information paradox.
  arXiv  Detail & Related papers  (2022-10-13T01:44:26Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Error Probability Mitigation in Quantum Reading using Classical Codes [4.125187280299247]
  Several tools can be applied in quantum reading to reduce the error probability in distinguishing the ensemble of channels. Three families of codes are considered: Reed-Solomon codes, BCH codes, and Reed-Muller codes. BCH codes in conjunction with Dolinar receiver turn out to be the optimal strategy for error mitigation in the quantum reading task.
  arXiv  Detail & Related papers  (2021-11-22T11:52:37Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• An End-to-end Method for Producing Scanning-robust Stylized QR Codes [45.35370585928748]
  We propose a novel end-to-end method, named ArtCoder, to generate stylized QR codes. The experimental results show that our stylized QR codes have high-quality in both the visual effect and the scanning-robustness.
  arXiv  Detail & Related papers  (2020-11-16T09:38:27Z)
• COSEA: Convolutional Code Search with Layer-wise Attention [90.35777733464354]
  We propose a new deep learning architecture, COSEA, which leverages convolutional neural networks with layer-wise attention to capture the code's intrinsic structural logic. COSEA can achieve significant improvements over state-of-the-art methods on code search tasks.
  arXiv  Detail & Related papers  (2020-10-19T13:53:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.