2000 character limit reached
Weighted-Hamming Metric for Parallel Channels
Published 31 Jan 2024 in cs.IT and math.IT | (2401.17801v2)
Abstract: Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The proposed weighted-Hamming metric is tailored to this setting and enables optimal decoding performance. We show that some weighted-Hamming-metric codes exhibit the unusual property that all errors beyond half the minimum distance can be corrected. Nevertheless, a tight relation between the error-correction capability of a code and its minimum distance can be established. Generalizing their Hamming-metric counterparts, upper and lower bounds on the cardinality of a code with a given weighted-Hamming distance are obtained. Finally, we propose a simple code construction with optimal minimum distance for specific parameters.
- Parallel error correcting codes. IEEE Transactions on Information Theory, 48(4):959–962, 2002.
- Design of raptor codes for parallel AWGN channels and slow-fading MIMO channels. In IEEE Military Communications Conference, pages 820–825, 2010.
- Class of generalized Goppa codes perfect in weighted Hamming metric. Designs, codes and cryptography, 66:391–399, 2013.
- M. Bossert. Channel Coding for Telecommunications. John Wiley & Sons, Inc., 1999.
- Density of free modules over finite chain rings. Linear Algebra and its Applications, 651:1–25, 2022.
- Bit-interleaved coded modulation. IEEE Transactions on Information Theory, 44(3):927–946, 1998.
- Optimum (n,2)𝑛2(n,2)( italic_n , 2 ) codes for small values of channel error probability. IEEE Transactions on Information Theory, 13(2):349–350, 1967.
- Encyclopedia of distances. Springer, 2009.
- P. G. Farrell. An introduction to anticodes. In Algebraic Coding Theory and Applications, pages 179–229. Springer, 1979.
- G. Forney. Generalized minimum distance decoding. IEEE Transactions on Information Theory, 12(2):125–131, 1966.
- E. M. Gabidulin. Combinatorial metrics in coding theory. In 2nd International Symposium on Information Theory, 1973.
- Capacity-achieving polar codes for arbitrarily permuted parallel channels. IEEE Transactions on Information Theory, 59(3):1505–1516, 2012.
- Decoding for iterative Reed-Solomon coding schemes. IEEE Transactions on Magnetics, 33(5):2740–2742, 1997.
- Reliable channel regions for good binary codes transmitted over parallel channels. IEEE Transactions on Information Theory, 52(4):1405–1424, 2006.
- F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes, volume 16. Elsevier, 1977.
- Analysis of communication channels related to physical unclonable functions. In Workshop on Coding and Cryptography (WCC), 2022.
- J. Max. Parallel channels without crosstalk, pages 77–81. MIT Lincoln Laboratory, 1968.
- M. Mitzenmacher. On the theory and practice of data recovery with multiple versions. In IEEE International Symposium on Information Theory, pages 982–986. IEEE, 2006.
- B. Moon. Weighted Hamming metric structures. Discrete Mathematics, 341(11):3174–3181, 2018.
- M. Plotkin. Binary codes with specified minimum distance. IRE Transactions on Information Theory, 6(4):445–450, 1960.
- Generic decoding in the sum-rank metric. IEEE Transactions on Information Theory, 68(8):5075–5097, 2022.
- E. A. Ratzer and D. J. C. MacKay. Sparse low-density parity-check codes for channels with cross-talk. In IEEE Information Theory Workshop, pages 127–130, 2003.
- Weighted Hamming distance for PUF performance evaluation. Electronics letters, 49(22):1376–1378, 2013.
- Coding for parallel channels: Gallager bounds and applications to turbo-like codes. IEEE Transactions on Information Theory, 53(7):2394–2428, 2007.
- On achievable rates and complexity of LDPC codes over parallel channels: Bounds and applications. IEEE Transactions on Information Theory, 53(2):580–598, 2007.
- Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs. IEEE Transactions on Information Theory, 55(7):2991–3012, 2009.
- On polyalphabetic block codes. In IEEE Information Theory Workshop, pages 4–pp, 2005.
- On metrics for error correction in network coding. IEEE Transactions on Information Theory, 55(12):5479–5490, 2009.
- J. Simonis. MacWilliams identities and coordinate partitions. Linear Algebra and its Applications, 216:81–91, 1995.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.