On Matrix Representation of Extension Field GF(pL) and Its Application in Vector Linear Network Coding
For a finite field GF(pL) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(pL) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF(pL), a conventional linear network coding sch...
Saved in:
| Published in | Entropy (Basel, Switzerland) Vol. 26; no. 10; p. 822 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Switzerland
MDPI AG
26.09.2024
MDPI |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | For a finite field GF(pL) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(pL) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF(pL), a conventional linear network coding scheme over GF(pL) can be transformed to an L-dimensional vector LNC scheme over GF(p). Recently, a few real implementations of coding schemes over GF(2L), such as the Reed–Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF(2L) to over GF(pL) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC. |
|---|---|
| AbstractList | For a finite field GF(pL) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(pL) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF(pL), a conventional linear network coding scheme over GF(pL) can be transformed to an L-dimensional vector LNC scheme over GF(p). Recently, a few real implementations of coding schemes over GF(2L), such as the Reed-Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF(2L) to over GF(pL) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC.For a finite field GF(pL) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(pL) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF(pL), a conventional linear network coding scheme over GF(pL) can be transformed to an L-dimensional vector LNC scheme over GF(p). Recently, a few real implementations of coding schemes over GF(2L), such as the Reed-Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF(2L) to over GF(pL) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC. For a finite field GF( pL ) with prime p and L>1 , one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF( pL ) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF( pL ), a conventional linear network coding scheme over GF( pL ) can be transformed to an L-dimensional vector LNC scheme over GF(p). Recently, a few real implementations of coding schemes over GF( 2L ), such as the Reed–Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF( 2L) to over GF( pL ) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC. For a finite field GF(p[sup.L]) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(p[sup.L]) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF(p[sup.L]), a conventional linear network coding scheme over GF(p[sup.L]) can be transformed to an L-dimensional vector LNC scheme over GF(p). Recently, a few real implementations of coding schemes over GF(2[sup.L]), such as the Reed–Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF(2[sup.L]) to over GF(p[sup.L]) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC. For a finite field GF( p L ) with prime p and L > 1 , one of the standard representations is L × L matrices over GF( p ) so that the arithmetic of GF( p L ) can be realized by the arithmetic among these matrices over GF( p ). Based on the matrix representation of GF( p L ), a conventional linear network coding scheme over GF( p L ) can be transformed to an L -dimensional vector LNC scheme over GF( p ). Recently, a few real implementations of coding schemes over GF( 2 L ), such as the Reed–Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF( 2 L ) to over GF( p L ) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC. For a finite field GF(pL) with prime and L>1, one of the standard representations is L×L matrices over GF( ) so that the arithmetic of GF(pL) can be realized by the arithmetic among these matrices over GF( ). Based on the matrix representation of GF(pL), a conventional linear network coding scheme over GF(pL) can be transformed to an -dimensional vector LNC scheme over GF( ). Recently, a few real implementations of coding schemes over GF(2L), such as the Reed-Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF(2L) to over GF(pL) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC. |
| Audience | Academic |
| Author | Sun, Qifu Tang, Hanqi Jin, Sheng Liu, Heping Liu, Wenli |
| AuthorAffiliation | School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China; tanghanqi1009@ustb.edu.cn (H.T.); 13121778655@163.com (H.L.); 13735677295@163.com (S.J.); lilyaccount00@163.com (W.L.) |
| AuthorAffiliation_xml | – name: School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China; tanghanqi1009@ustb.edu.cn (H.T.); 13121778655@163.com (H.L.); 13735677295@163.com (S.J.); lilyaccount00@163.com (W.L.) |
| Author_xml | – sequence: 1 givenname: Hanqi orcidid: 0000-0001-7248-5500 surname: Tang fullname: Tang, Hanqi – sequence: 2 givenname: Heping surname: Liu fullname: Liu, Heping – sequence: 3 givenname: Sheng surname: Jin fullname: Jin, Sheng – sequence: 4 givenname: Wenli surname: Liu fullname: Liu, Wenli – sequence: 5 givenname: Qifu orcidid: 0000-0003-3213-1569 surname: Sun fullname: Sun, Qifu |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/39451899$$D View this record in MEDLINE/PubMed |
| BookMark | eNpdkstuEzEUhkeoiF5gwQsgS2zaRYpv49grFEVNGylQCQFby7GPg8PEHuwJlLev05SoRV7YPv70n4v_0-YopghN85bgS8YU_gBUEIwlpS-aE4KVGnGG8dGT83FzWsoaY8ooEa-aY6Z4S6RSJ42_jeiTGXK4Q1-gz1AgDmYIKaLk0dXdALHsLrMAnUPXs_N-cYFMdGg-FDTp-y7YPR0i-g52SBktQgST0WcY_qT8E02TC3H1unnpTVfgzeN-1nybXX2d3owWt9fz6WQxslyoYUQUUdxLRoiUY8aWrpXLMeacSCsclYCBLo23tMXACbcCt86ZtgXCHPbGeXbWzPe6Lpm17nPYmPxXJxP0QyDllTZ5CLYDrVqgxGIqLOW8akqmhPEtZVwKMsY7rY97rX673ICzdTLZdM9En7_E8EOv0m9NSIvHkoqqcP6okNOvLZRBb0Kx0HUmQtoWzQjFraqJaUXf_4eu0zbHOqsHSjDJKKvU5Z5amdpBiD7VxLYuB5tgqyl8qPGJJJzJ-sW7Ct497eFQ_D8DVOBiD9icSsngDwjBemcufTAXuwdNsb2i |
| Cites_doi | 10.1109/TIT.2010.2079016 10.1109/TCOMM.2018.2890260 10.1017/CBO9780511525926 10.1109/LCOMM.2022.3210653 10.1109/TIT.2018.2832624 10.1109/TC.2013.23 10.1109/TIT.2010.2094930 10.1109/TCOMM.2020.3001133 10.1145/3375554 10.1080/0025570X.1994.11996233 10.1109/TIT.2018.2797183 10.1109/TCOMM.2016.2613085 10.1109/TWC.2010.02.081057 10.1109/TIT.2002.807285 |
| ContentType | Journal Article |
| Copyright | COPYRIGHT 2024 MDPI AG 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. 2024 by the authors. 2024 |
| Copyright_xml | – notice: COPYRIGHT 2024 MDPI AG – notice: 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: 2024 by the authors. 2024 |
| DBID | AAYXX CITATION NPM 7TB 8FD 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO FR3 HCIFZ KR7 L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS 7X8 5PM DOA |
| DOI | 10.3390/e26100822 |
| DatabaseName | CrossRef PubMed Mechanical & Transportation Engineering Abstracts Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials Proquest Central Technology Collection ProQuest One ProQuest Central Engineering Research Database SciTech Premium Collection Civil Engineering Abstracts ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central Essentials ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Civil Engineering Abstracts Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic Publicly Available Content Database CrossRef PubMed |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 1099-4300 |
| ExternalDocumentID | oai_doaj_org_article_95e21c026c244fc28396af523486170f PMC11507826 A814389456 39451899 10_3390_e26100822 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 62101028 – fundername: National Natural Science Foundation of China grantid: 62271044 – fundername: Fundamental Research Funds for the 289 Central Universities grantid: FRF-TP-22-041A1 – fundername: National Natural Science Foundation of China grantid: U22A2005 – fundername: National Natural Science Foundation of China grantid: U22A2005; 62101028; 62271044 – fundername: Fundamental Research Funds for the Central Universities grantid: FRF-TP-22-041A1 |
| GroupedDBID | 29G 2WC 5GY 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ACIWK ACUHS ADBBV AEGXH AENEX AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS BCNDV BENPR BGLVJ CCPQU CITATION CS3 DU5 E3Z ESX F5P GROUPED_DOAJ GX1 HCIFZ HH5 IAO ITC J9A KQ8 L6V M7S MODMG M~E OK1 OVT PGMZT PHGZM PHGZT PIMPY PROAC PTHSS RNS RPM TR2 TUS XSB ~8M NPM 7TB 8FD ABUWG AZQEC DWQXO FR3 KR7 PKEHL PQEST PQGLB PQQKQ PQUKI PRINS 7X8 5PM PUEGO |
| ID | FETCH-LOGICAL-c469t-19194f831188733bd58b704418c6d28e0e2bafc250e414c605dda55e13d0fadf3 |
| IEDL.DBID | BENPR |
| ISSN | 1099-4300 |
| IngestDate | Wed Aug 27 01:28:08 EDT 2025 Thu Aug 21 18:43:44 EDT 2025 Fri Jul 11 09:07:34 EDT 2025 Fri Jul 25 11:54:37 EDT 2025 Tue Jul 01 05:40:24 EDT 2025 Thu Jan 02 22:29:33 EST 2025 Tue Jul 01 01:58:32 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Keywords | finite field vector linear network coding matrix representation |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c469t-19194f831188733bd58b704418c6d28e0e2bafc250e414c605dda55e13d0fadf3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0001-7248-5500 0000-0003-3213-1569 |
| OpenAccessLink | https://www.proquest.com/docview/3120638323?pq-origsite=%requestingapplication% |
| PMID | 39451899 |
| PQID | 3120638323 |
| PQPubID | 2032401 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_95e21c026c244fc28396af523486170f pubmedcentral_primary_oai_pubmedcentral_nih_gov_11507826 proquest_miscellaneous_3120598392 proquest_journals_3120638323 gale_infotracacademiconefile_A814389456 pubmed_primary_39451899 crossref_primary_10_3390_e26100822 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20240926 |
| PublicationDateYYYYMMDD | 2024-09-26 |
| PublicationDate_xml | – month: 9 year: 2024 text: 20240926 day: 26 |
| PublicationDecade | 2020 |
| PublicationPlace | Switzerland |
| PublicationPlace_xml | – name: Switzerland – name: Basel |
| PublicationTitle | Entropy (Basel, Switzerland) |
| PublicationTitleAlternate | Entropy (Basel) |
| PublicationYear | 2024 |
| Publisher | MDPI AG MDPI |
| Publisher_xml | – name: MDPI AG – name: MDPI |
| References | Etzion (ref_4) 2018; 64 Tang (ref_7) 2023; 27 Gao (ref_19) 2010; 56 ref_14 Luo (ref_11) 2014; 63 ref_13 ref_12 Sun (ref_3) 2016; 64 ref_10 Sun (ref_6) 2019; 67 Wardlaw (ref_8) 1994; 67 Tang (ref_5) 2019; 65 Li (ref_1) 2003; 49 ref_16 Zhou (ref_15) 2020; 16 ref_9 Asterjadhi (ref_18) 2010; 9 Su (ref_17) 2020; 68 Ebrahimi (ref_2) 2011; 57 |
| References_xml | – ident: ref_9 – volume: 56 start-page: 6265 year: 2010 ident: ref_19 article-title: Additive fast Fourier transforms over finite fields publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2010.2079016 – volume: 67 start-page: 2660 year: 2019 ident: ref_6 article-title: Circular-shift linear network codes with arbitrary odd block lengths publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2018.2890260 – ident: ref_16 doi: 10.1017/CBO9780511525926 – volume: 27 start-page: 105 year: 2023 ident: ref_7 article-title: The multicast solvability of permutation linear network coding publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2022.3210653 – ident: ref_12 – ident: ref_10 – volume: 65 start-page: 65 year: 2019 ident: ref_5 article-title: Circular-shift linear network coding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2018.2832624 – volume: 63 start-page: 2259 year: 2014 ident: ref_11 article-title: Efficient encoding schedules for XOR-based erasure codes publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2013.23 – volume: 57 start-page: 996 year: 2011 ident: ref_2 article-title: Algebraic algorithm for vecor network coding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2010.2094930 – volume: 68 start-page: 5606 year: 2020 ident: ref_17 article-title: Delay-complexity trade-off of random linear network coding in wireless broadcast publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2020.3001133 – ident: ref_13 – ident: ref_14 – volume: 16 start-page: 1 year: 2020 ident: ref_15 article-title: Fast erasure coding for data storage: A comprehensive study of the acceleration techniques publication-title: ACM Trans. Storage (TOS) doi: 10.1145/3375554 – volume: 67 start-page: 289 year: 1994 ident: ref_8 article-title: Matrix representation of finite field publication-title: Math. Mag. doi: 10.1080/0025570X.1994.11996233 – volume: 64 start-page: 2460 year: 2018 ident: ref_4 article-title: Vector network coding based on subspace codes outperforms scalar linear network coding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2018.2797183 – volume: 64 start-page: 5096 year: 2016 ident: ref_3 article-title: On vector linear solvability of multicast networks publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2016.2613085 – volume: 9 start-page: 662 year: 2010 ident: ref_18 article-title: Toward network coding-based protocols for data broadcasting in wireless ad hoc networks publication-title: IEEE Trans. Wirel. Commun. doi: 10.1109/TWC.2010.02.081057 – volume: 49 start-page: 371 year: 2003 ident: ref_1 article-title: Linear network coding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2002.807285 |
| SSID | ssj0023216 |
| Score | 2.3551738 |
| Snippet | For a finite field GF(pL) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(pL) can be realized... For a finite field GF(pL) with prime and L>1, one of the standard representations is L×L matrices over GF( ) so that the arithmetic of GF(pL) can be realized... For a finite field GF(p[sup.L]) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(p[sup.L]) can... For a finite field GF( p L ) with prime p and L > 1 , one of the standard representations is L × L matrices over GF( p ) so that the arithmetic of GF( p L )... For a finite field GF( pL ) with prime p and L>1 , one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF( pL ) can be... |
| SourceID | doaj pubmedcentral proquest gale pubmed crossref |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database |
| StartPage | 822 |
| SubjectTerms | Arithmetic Coding Correlation Fields (mathematics) finite field Libraries Lookup tables Matrix representation vector linear network coding |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Nb9QwEB2hPXFBoFIILJWpKgGHqIm_4hy3VZe2aouEKNqb5fhD9OJd0a3Un9-xk1024sCFY2wrcmZsz3vx-BngyFPLQ92J0mM0L7kzvFTSqNKFRgTpsCDrbF_fyPNbfrkQi52rvlJOWC8P3BvuuBWe1haZgsVAFCxGw1aagPSJq6QlHtLqizFvQ6YGqsVoLXsdIYak_tgjT8ja5qPok0X6_16Kd2LROE9yJ_DMX8KLATGSWd_TV_DMxz0I3yK5Tur6j-R7zmUdjhBFsgzk7DGnpePDPOWnka_zz6urL8RERy7W92T2Z8-a3EXyM_-3J0hKcdCTmz4tnJwuU1B7Dbfzsx-n5-VwZUJpkeeuS2RfLQ-KIW1QDWOdE6prKoQ8ykpHla887QxaUVSe19wil3HoDeFr5qpgXGD7MInL6N8C8Q7XQmtaFXzLq06oVjYdd9wiB6GybQo43JhSr3plDI2MItlbb-1dwEky8rZBErPOBehiPbhY_8vFBXxKLtJpyqEfrBlODmA_k3iVnql8hztCwQKmGy_qYS7ea1bThMsYZQV83FbjLEpbIyb65UPfRrQJLBbwpnf6ts8M31wjLS1AjYbD6KPGNfHuV1bqznAbCdy7_2GG9_CcIqJKySpUTmGy_v3gPyAiWncHefA_Ab0TByo priority: 102 providerName: Directory of Open Access Journals |
| Title | On Matrix Representation of Extension Field GF(pL) and Its Application in Vector Linear Network Coding |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/39451899 https://www.proquest.com/docview/3120638323 https://www.proquest.com/docview/3120598392 https://pubmed.ncbi.nlm.nih.gov/PMC11507826 https://doaj.org/article/95e21c026c244fc28396af523486170f |
| Volume | 26 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Na9wwEB2SzaWX0tIvp-milkLbg8lakm35VDZhvUlptiU0ZW9G1keSi73JbiA_PyNZ68QUejFYFkbWSDPvSeMngM-GKm6TOo0NRvOYa8ljkUkRa5unNtNY4HW2zxbZyQX_sUyXYcFtHdIqtz7RO2rdKrdGfsgS6qIro-z76iZ2p0a53dVwhMYu7KELFmIEe0ezxe_znnIxmmSdnhBDcn9okC94jfNBFPJi_f-65CcxaZgv-SQAlS_geUCOZNqZ-iXsmOYV2F8NOXMq-_fk3Oe0hl-JGtJaMrv36el4U7o8NTIvv65-fiOy0eR0sybTx71rct2Qv379niA5xcFPFl16ODluXXB7DRfl7M_xSRyOTogV8t1NjCys4FYwpA8iZ6zWqajzCUIfoTJNhZkYWkurEP8YnnCFnEajVVKTMD2xUlv2BkZN25h3QIxGn6hkIawp-KRORZHlNddcIRehWZFH8GnbldWqU8iokFm4_q76_o7gyHVyX8GJWvuC9vayCnOkKlJDE4WkUCHmwMYhdsukRabMhZONtxF8cSaq3NRDOygZ_iDAdjoRq2oq_FnuCAkjONhasQpzcl09jqAIPvaPcTa5LRLZmPauq5MWDjRG8LYzet9mhm9OkJ5GIAbDYfBRwyfN9ZVX7PawG4nc_v_b9R6eUcRMLh2FZgcw2tzemQ-IeTb1GHZFOR-H4T32Kwd4nS-TB0nQBCo |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwEB6VcoALAvEKLWAQCDhETWwncQ4ILaXbXbq7SKhFvZnED9pLsnS3ovwpfiNj59FGSNx6TBxFk5mx5_vi8QzAK0MVt3GZhAajech1wUORFiLUNktsqvGGr7M9X6STI_75ODnegD_dWRiXVtmtiX6h1rVy_8h3WExddGWUfVj-DF3XKLe72rXQaNziwPz-hZRt9X76Ce37mtLx3uHuJGy7CoQKqeA6RIKScysYImuRMVbqRJRZhKhAqFRTYSJDy8IqhAaGx1wh3NcocGJipiNbaMvwvTfgJmcYyd3J9PF-T_AYjdOmehEORjsG2YmvqD6Ieb41wL8B4EoEHGZnXgl347twp8WpZNQ41j3YMNV9sF8qMnc1_S_IV59B2x5cqkhtyd6FT4bHi7HLiiP747fL2TtSVJpM1ysyutwpJ6cV-eZ3CwhSYdQpWTTJ6GS3dqH0ARxdi0ofwmZVV-YxEKNxBVZFLqzJeVQmIk-zkmuukPnQNM8CeNmpUi6behwSeYzTt-z1HcBHp-T-AVdC29-oz37IdkbKPDE0VkhBFSIcFA6RYlpY5OVcuCL1NoA3zkTSTXS0gyra8woopyuZJUfCd45HABrAdmdF2a4AK3nprwG86Idx7roNmaIy9XnzTJI7iBrAo8bovcwM3xwjGQ5ADNxh8FHDker0xNcH9yAfaeOT_8v1HG5NDuczOZsuDrbgNkW05hJhaLoNm-uzc_MU0da6fOZdnMD3655TfwFiWzw4 |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwEB6VrYS4IBCvQAGDQMAh2sR2EueA0Lbd0KXtUlUU9RYSP9pekqW7FeWv8esYO482QuLW4yZRNDsPz_fF4xmAN5pKbsIy8jVmc5-rgvsiLoSvTBKZWOEF12d7fx7vHPEvx9HxGvzpzsLYsspuTXQLtaql_UY-ZiG12ZVRNjZtWcTBdvZp8dO3E6TsTms3TqNxkV39-xfSt-XH2Tba-i2l2fTb1o7fThjwJdLClY9kJeVGMETZImGsVJEokwARgpCxokIHmpaFkQgTNA-5ROivUPhIh0wFplCG4XtvwXpiWdEI1jen84PDnu4xGsZNLyPG0mCskau4_uqDDOgGBfybDq7lw2Gt5rXkl92Duy1qJZPGze7Dmq4egPlakX3b4f-SHLp62vYYU0VqQ6aXrjQef2S2Ro58zt4v9j6QolJktlqSydW-OTmryHe3d0CQGKNWybwpTSdbtU2sD-HoRpT6CEZVXeknQLTC9VgWqTA65UEZiTROSq64RB5E4zTx4HWnynzRdOfIkdVYfee9vj3YtEruH7ANtd2F-vwkb-MzTyNNQ4mEVCLeQeEQN8aFQZbOhW1Zbzx4Z02U27BHO8iiPb2ActoGWvlEuDnyCEc92OismLfrwTK_8l4PXvW3MZLt9kxR6fqieSZKLWD14HFj9F5mhm8OkRp7IAbuMPhTwzvV2anrFu4gP5LIp_-X6yXcxnjK92bz3WdwhyJ0s1UxNN6A0er8Qj9H6LUqX7Q-TuDHTYfVX146Qco |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+Matrix+Representation+of+Extension+Field+GF%28+p+L+%29+and+Its+Application+in+Vector+Linear+Network+Coding&rft.jtitle=Entropy+%28Basel%2C+Switzerland%29&rft.au=Tang%2C+Hanqi&rft.au=Liu%2C+Heping&rft.au=Jin%2C+Sheng&rft.au=Liu%2C+Wenli&rft.date=2024-09-26&rft.eissn=1099-4300&rft.volume=26&rft.issue=10&rft_id=info:doi/10.3390%2Fe26100822&rft_id=info%3Apmid%2F39451899&rft.externalDocID=39451899 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1099-4300&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1099-4300&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1099-4300&client=summon |