Výsledky vyhledávání - Optimal binary linear code

Upřesnit hledání
  1. 1

    Optimal Binary Linear Codes From Maximal Arcs Autor Heng, Ziling, Ding, Cunsheng, Wang, Weiqiong

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York IEEE 01.09.2020
    “… The first objective of this paper is to construct a class of binary linear codes with parameters <inline-formula> <tex-math notation="LaTeX">[{2^{m+s}+2^{s}-2^{m},2^{m+s}+2^{s}-2^{m}-2m-2,4}] </tex-math></inline-formula…”
    Získat plný text
    Journal Article
  2. 2

    On the Error Coefficients of Asymptotic Frame Error Rate Optimal Binary Linear Codes Autor Li, Shitao, Luo, Gaojun, Shi, Minjia, Ling, San

    ISSN: 0018-9448, 1557-9654
    Vydáno: IEEE 01.07.2025
    “…A binary linear code is called asymptotic frame error rate (AFER)-optimal if it achieves the maximum possible value of the minimum distance while having the smallest value of the corresponding error coefficient…”
    Získat plný text
    Journal Article
  3. 3

    Infinite Families of Few Weight Optimal Binary Linear Codes From Multivariable Functions Autor Yoon Hyun, Jong, Jeong, Jihye, Lee, Yoonjin

    ISSN: 0018-9448, 1557-9654
    Vydáno: IEEE 01.10.2024
    “…-) optimal binary linear codes from our code families. Furthermore, we produce support t-designs (<inline-formula> <tex-math notation="LaTeX">t = 2 </tex-math></inline-formula> or 3…”
    Získat plný text
    Journal Article
  4. 4

    Three New Families of Binary AFER-Optimal Linear Codes Autor Tong, Tingting, Hu, Sihuang

    ISSN: 0018-9448, 1557-9654
    Vydáno: IEEE 01.01.2026
    “… In this paper, we propose novel approaches, different from existing methods, to produce three new families of binary optimal linear codes with the smallest possible error coefficients…”
    Získat plný text
    Journal Article
  5. 5

    Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels Autor Fazeli, Arman, Hassani, Hamed, Mondelli, Marco, Vardy, Alexander

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York IEEE 01.09.2021
    “… under the best possible scaling of their block length as a function of the gap to capacity. This result exhibits the first known family of binary codes that attain both optimal scaling and quasi-linear complexity of encoding and decoding…”
    Získat plný text
    Journal Article
  6. 6

    Optimal binary linear codes of length ⩽30 Autor Jaffe, David B.

    ISSN: 0012-365X, 1872-681X
    Vydáno: Elsevier B.V 28.08.2000
    Vydáno v Discrete mathematics (28.08.2000)
    “…For n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal [n,k,d…”
    Získat plný text
    Journal Article
  7. 7

    An optimal binary linear functional-repair storage code with efficient repair related to PG(2,8): An optimal functional-repair storage code Autor Hollmann, Henk D. L., Ke, Junming, Riet, Ago-Erik

    ISSN: 0925-1022, 1573-7586
    Vydáno: New York Springer US 01.11.2025
    Vydáno v Designs, codes, and cryptography (01.11.2025)
    “… bound, different from the MSR and MBR points. Here we present another such code, based on a vector space partition of a 9-dimensional binary space into 73 subspaces of dimension 3 that is strongly related to the projective plane PG(2,8…”
    Získat plný text
    Journal Article
  8. 8

    Optimal binary LCD codes Autor Bouyuklieva, Stefka

    ISSN: 0925-1022, 1573-7586
    Vydáno: New York Springer US 01.11.2021
    Vydáno v Designs, codes, and cryptography (01.11.2021)
    “…Linear complementary dual codes (shortly LCD codes) are codes whose intersections with their dual codes are trivial…”
    Získat plný text
    Journal Article
  9. 9

    Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs Autor Kim, Jon-Lark

    ISSN: 2238-3603, 1807-0302
    Vydáno: Cham Springer International Publishing 01.04.2023
    Vydáno v Computational & applied mathematics (01.04.2023)
    “…The hull of a linear code C is the intersection of C with its dual. To the best of our knowledge, there are very few constructions of binary linear codes with the hull dimension…”
    Získat plný text
    Journal Article
  10. 10

    A Class of Distance-Optimal Binary Linear Codes With Flexible Parameters Autor Tang, Deng, Fan, Cuiling

    ISSN: 1089-7798
    Vydáno: IEEE 01.09.2017
    Vydáno v IEEE communications letters (01.09.2017)
    “… We determine the weight distributions of all the generated binary linear codes and, most notably, mathematically prove that all these codes are distance-optimal…”
    Získat plný text
    Journal Article
  11. 11

    Optimal minimal linear codes from posets Autor Hyun, Jong Yoon, Kim, Hyun Kwang, Wu, Yansheng, Yue, Qin

    ISSN: 0925-1022, 1573-7586
    Vydáno: New York Springer US 01.12.2020
    Vydáno v Designs, codes, and cryptography (01.12.2020)
    “…Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al…”
    Získat plný text
    Journal Article
  12. 12

    An optimal binary linear functional-repair storage code with efficient repair related to PG(2,8) Autor Hollmann, Henk D. L, Ke, Junming, Riet, Ago-Erik

    ISSN: 0925-1022, 1573-7586
    Vydáno: Dordrecht Springer Nature B.V 01.11.2025
    Vydáno v Designs, codes, and cryptography (01.11.2025)
    “… bound, different from the MSR and MBR points. Here we present another such code, based on a vector space partition of a 9-dimensional binary space into 73 subspaces of dimension 3 that is strongly related to the projective plane PG(2,8…”
    Získat plný text
    Journal Article
  13. 13
  14. 14

    Optimal Binary Linear Complementary Pairs of Codes Autor Choi, Whan-Hyuk, Güneri, Cem, Kim, Jon-Lark, Özbudak, Ferruh

    ISSN: 1936-2447, 1936-2455
    Vydáno: New York Springer US 01.03.2023
    Vydáno v Cryptography and communications (01.03.2023)
    “… Motivated by this, we study binary LCPs of codes. We describe a sufficient condition for binary LCPs of codes which are not optimal…”
    Získat plný text
    Journal Article
  15. 15

    Projection Decoding of Some Binary Optimal Linear Codes of Lengths 36 and 40 Autor Galvez, Lucky, Kim, Jon-Lark

    ISSN: 2227-7390, 2227-7390
    Vydáno: Basel MDPI AG 01.01.2020
    Vydáno v Mathematics (Basel) (01.01.2020)
    “… We show that two binary optimal [ 36 , 19 , 8 ] linear codes and two binary optimal [ 40 , 22 , 8 ] codes have an efficient decoding algorithm…”
    Získat plný text
    Journal Article
  16. 16

    Optimal binary and ternary linear codes with hull dimension one Autor Mankean, Todsapol, Jitman, Somphong

    ISSN: 1598-5865, 1865-2085
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2020
    “… Optimal linear [ n , 2 , d ] q codes with hull dimension one are presented for all positive integers n ≥ 3 and q ∈ { 2 , 3 } . Moreover, for q…”
    Získat plný text
    Journal Article
  17. 17

    Optimal Binary Linear Complementary Pairs from Solomon-Stiffler Codes Autor Guneri, Cem

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York IEEE 01.10.2023
    “… For binary codes, they proved that the security parameter of a linear complementary pair of codes is lower bounded by d L - 1. Choi et al…”
    Získat plný text
    Journal Article
  18. 18

    Two Families of Optimal Binary Linear Complementary Pairs of Codes Autor Li, Xia, Li, Zhaole

    ISSN: 2227-7390, 2227-7390
    Vydáno: Basel MDPI AG 01.09.2025
    Vydáno v Mathematics (Basel) (01.09.2025)
    “…The optimal security parameters for binary linear complementary pair (LCP) codes are open. Inspired by this, we study LCPs of codes…”
    Získat plný text
    Journal Article
  19. 19

    Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes Autor Hyun, Jong Yoon, Lee, Jungyun, Lee, Yoonjin

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York IEEE 01.11.2020
    “… We construct infinite families of optimal binary linear codes <inline-formula> <tex-math notation="LaTeX">C_{\Delta ^{c}} </tex-math></inline-formula> constructed from simplicial complexes…”
    Získat plný text
    Journal Article
  20. 20

    Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes Autor Luo, Gaojun, Cao, Xiwang

    ISSN: 0090-6778, 1558-0857
    Vydáno: New York IEEE 01.08.2021
    Vydáno v IEEE transactions on communications (01.08.2021)
    “… The aim of this paper is to construct optimal binary locally recoverable codes meeting the alphabet-dependent bound…”
    Získat plný text
    Journal Article