Skip to main content

CODIGOS OPTIMOS Y SUS APLICACIONES A LA CRIPTOGRAFIA Y ALMACENAMIENTO DE DATOS. SOFTWARE PARA LA EXPERIMENTACION EN TEORIA DE CODIGOS

TIN2013-40524-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2013
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 33
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Classification of the Z₂ Z₄-linear Hadamard codes and their automorphism groups

  • Krotov, Denis S.
  • Villanueva, M.|||0000-0001-6179-0833
A Z₂ Z₄-linear Hadamard code of length α + 2β = 2t is a binary Hadamard code, which is the Gray map image of a Z₂ Z₄-additive code with α binary coordinates and β quaternary coordinates. It is known that there are exactly ⌊t-1/2⌋ and ⌊t/2⌋ nonequivalent Z₂ Z₄-linear Hadamard codes of length 2t, with α = 0 and α ≠ 0, respectively, for all t ≥ 3. In this paper, it is shown that each Z₂ Z₄-linear Hadamard code with α = 0 is equivalent to a Z₂ Z₄-linear Hadamard code with α ≠ 0, so there are only ⌊t/2⌋ nonequivalent Z₂ Z₄-linear Hadamard codes of length 2t. Moreover, the order of the monomial automorphism group for the Z2Z4-additive Hadamard codes and the permutation automorphism group of the corresponding Z₂ Z₄-linear Hadamard codes are given.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Efficient representation of binary nonlinear codes, constructions and minimum distance computation

  • Villanueva, M.|||0000-0001-6179-0833
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Zeng, Fanxuan
A binary nonlinear code can be represented as a union of cosets of a binary linear subcode. In this paper, the complexity of some algorithms to obtain this representation is analyzed. Moreover, some properties and constructions of new codes from given ones in terms of this representation are described. Algorithms to compute the minimum distance of binary nonlinear codes, based on known algorithms for linear codes, are also established, along with an algorithm to decode such codes. All results are written in such a way that they can be easily transformed into algorithms, and the performance of these algorithms is evaluated.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Construction of Hadamard Z₂Z₄Q₈-codes for each allowable value of the rank and dimension of the kernel

  • Montolio, Pere
  • Rifà, Josep|||0000-0001-9199-4001
This work deals with Hadamard Z₂Z₄Q₈-codes, which are binary codes after a Gray map from a subgroup of a direct product of Z₂, Z₄ and Q₈ groups, where Q₈ is the quaternionic group. In a previous work, these kind of codes were classified in five shapes. In this paper we analyze the allowable range of values for the rank and dimension of the kernel, which depends on the particular shape of the code. We show that all these codes can be represented in a standard form, from a set of generators, which help to understand the characteristics of each shape. The main results we present are the characterization of Hadamard Z₂Z₄Q₈-codes as a quotient of a semidirect product of Z₂Z₄-linear codes and, on the other hand, the construction of Hadamard Z₂Z₄Q₈-codes with each allowable pair of values for the rank and dimension of the kernel.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Permutation decoding of Z₂Z₄-linear codes

  • Bernal, José Joaquín
  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M.|||0000-0001-6179-0833
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codessuch as Z₂Z₄ -linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As particular examples, this permutation decoding method is applied to some Hadamard Z₂Z₄ -linear codes.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Partial permutation decoding for binary linear Hadamard codes

  • Barrolleta, Roland David
  • Villanueva, M.|||0000-0001-6179-0833
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group PAut(C) of a code C in order to assist in decoding. A method to obtain s-PD-sets of size s + 1 for partial permutation decoding for the binary linear Hadamard codes H m of length 2 m , for all m ≥ 4 and 1 < s ≤ (2 m - m - 1)/(1 + m) , is described. Moreover, a recursive construction to obtain s-PD-sets of size s + 1 for H m+1 of length 2 m+1 , from a given s-PD-set of the same size for the Hadamard code of half length H m is also established.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Self-dual codes from 3-class association schemes

  • Bilal, Muhammad
  • Borges, Joaquim|||0000-0002-5774-4874
  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
3-class association schemes are used to construct binary self-dual codes. We use the pure and bordered construction to get self-dual codes starting from the adjacency matrices of symmetric and non-symmetric 3-class association schemes. In some specific cases, we also study constructions of self-dual codes over Z k . For symmetric 3-class association schemes, we focus on the rectangular scheme and association schemes derived from symmetric designs.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

About a class of Hadamard propelinear codes

  • Rifà, Josep|||0000-0001-9199-4001
  • Suárez Canedo, E.
This article aims to explore the algebraic structure of Hadamard propelinear codes, which are not abelian in general but they have good algebraic and combinatorial properties. We construct a subclass of Hadamard propelinear codes which enlarges the family of the Hadamard translation invariant propelinear codes. Several papers have been devoted to the relations between difference sets, t-designs, cocyclic-matrices and Hadamard groups, and we present a link between them and a class of Hadamard propelinear codes, which we call full propelinear. Finally, as an exemplification, we provide a full propelinear structure for all Hadamard codes of length sixteen.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Z₂Z₄-additive formally self-dual codes

  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
We study odd and even Z₂Z₄ formally self-dual codes. The images of these codes are binary codes whose weight enumerators are that of a formally self-dual code but may not be linear. Three constructions are given for formally self-dual codes and existence theorems are given for codes of each type defined in the paper.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Families of nested completely regular codes and distance-regular graphs

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius ρ equal to 3 or 4, and are 1/2 i th parts, for i ∈ {1, ... , u} of binary (respectively, extended binary) Hamming codes of length n = 2 m - 1 (respectively, 2 m ), where m = 2u. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D equal to 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive. This gives antipodal covers of some distance-regular and distance-transitive graphs.
Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

Nonlinear q-ary codes, constructions and minimum distance computation

  • Villanueva, M.|||0000-0001-6179-0833
  • Zeng, Fanxuan
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
A nonlinear code can be represented as the union of cosets of a linear subcode. Properties and constructions of new codes from given ones in terms of this representation can be described. Algorithms to compute the minimum distance of nonlinear codes, based on known algorithms for linear codes, are also established. Moreover, the performance of these algorithms is studied and an estimation of the number of enumerated codewords needed in the computations is given.
Dipòsit Digital de Documents de la UAB
Publication

Survey on Z₂Z₄-additive codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Rifà, Josep|||0000-0001-9199-4001
  • Villanueva, M.|||0000-0001-6179-0833
A code C is Z₂Z₄-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C by deleting the coordinates outside X (respectively, Y ) is a binary linear code (respectively, a quaternary linear code). The corresponding binary codes of Z₂Z₄-additive codes under an extended Gray map are called Z₂Z₄-linear codes, which seem to be a very distinguished class of binary group codes. As for binary and quaternary linear codes, for these codes the fundamental parameters are shown and standard forms for generator and parity-check matrices are given, defining the appropriate concept of duality. The main results on Z₂Z₄-additive self-dual and Z₂Z₄-additive formally self-dual codes are also presented, as well as, the results on the invariants rank and dimension of the kernel for these codes are given. Several families of important binary codes fall in the class of Z₂Z₄-linear codes. In this survey, we review characterizations, properties and constructions of perfect and extended perfect Z₂Z₄-linear codes, Hadamard Z₂Z₄-linear codes, Reed-Muller Z₂Z₄-linear codes, maximum distance separable Z₂Z₄-linear codes, and Preparata-like and Kerdock-like Z₂Z₄-linear codes. Finally, applications of Z₂Z₄-additive codes to steganography are also presented.
Dipòsit Digital de Documents de la UAB
Publication

On nested completely regular codes and distance regular graphs

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
Dipòsit Digital de Documents de la UAB
Publication

Z₂Z₄-additive cyclic codes, generator polynomials and dual codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
A Z₂Z₄-additive code C ⊆ Zα2 × Zβ₄ is called cyclic code if the set of coordinates can be partitioned into two subsets, the set of Z₂ and the set of Z₄ coordinates, such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z₄[x]-module Z₂[x]/(x^α - 1) × Z₄ [x]/(x^β - 1). The parameters of a Z₂Z₄-additive cyclic code are stated in terms of the degrees of the generator polynomials of the code. The generator polynomials of the dual code of a Z₂Z₄-additive cyclic code are determined in terms of the generator polynomials of the code C.
Dipòsit Digital de Documents de la UAB
Publication

Z₂-double cyclic codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
A binary linear code C is a Z2-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z2[x]-module Z2[x]/(x^r - 1) × Z2[x]/(x^s - 1). We determine the structure of Z2-double cyclic codes giving the generator polynomials of these codes. The related polynomial representation of Z2-double cyclic codes and its duals, and the relations between the polynomial generators of these codes are studied.
Dipòsit Digital de Documents de la UAB
Publication

Double cyclic codes over the rings Zα2 × Zβ2 and Zα2 × Zβ4

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
Consider the rings R1 and R2 , such that R1 is an R2-module, and C ⊂ R1α × R2β an additive code. The code C is a double cyclic code if the set of coordinates can be partitioned into two subsets, the set of coordinates in R1 and the set of coordinates in R2 , such that any cyclic shift of the coordinates of both subsets leaves invariant the code. The code can be identified as submodules of the R2[x]-module R1[x]/(x^α - 1) × R2[x]/(x^β - 1). We define two cases. First, when the code C is binary, that is R1 = R2 = Z2 , which is called Z2-double cyclic. The second case is when R1 = Z2 and R2 = Z4 , that is the code is a Z2Z4-additive code, and it is called Z2Z4-cyclic. In both cases, we determine the structure of these double cyclic codes giving their generator polynomials. We also determine the related polynomial representation of its duals in terms of the generator polynomials.
Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

PD-sets for (nonlinear) Hadamard Z₄-linear codes

Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

Kronecker sums to construct Hadamard full propelinear codes of type CnQ₈

Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

On ZprZps-additive cyclic codes

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Ranks and kernels of codes from generalized Hadamard matrices

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

About some Hadamard full propelinear (2t,2,2)-codes, Rank and Kernel

  • Bailera, Ivan|||0000-0001-6772-4802
  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
A new subclass of Hadamard full propelinear codes is introduced in this article. We define the HFP(2t,2,2)-codes as codes with a group structure isomorphic to C₂t × C₂^2. Concepts such as rank and dimension of the kernel are studied, and bounds for them are established. For t odd, r=4t-1 and k=1. For t even, r≤2t and k≠2, and r=2t if and only if t≢0 (mod 4).
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Construction and classification of Z₂s-linear Hadamard codes

  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Vela, C.
  • Villanueva, M|||0000-0001-6179-0833
The Z₂s-additive and Z₂Z₄-additive codes are subgroups of Z₂s^n and Z₂^α × Z₄^β, respectively. Both families can be seen as generalizations of linear codes over Z₂ and Z₄. A Z₂s-linear (resp. Z₂Z₄-linear) Hadamard code is a binary Hadamard code which is the Gray map image of a Z₂s-additive (resp. Z₂Z₄-additive) code. It is known that there are exactly ⌊(t-1)/2⌋ and ⌊t/2⌋ nonequivalent Z₂Z₄-linear Hadamard codes of length 2ᵗ, with α=0 and α≠0, respectively, for all t≥3. In this paper, new Z₂s-linear Hadamard codes are constructed for s>2, which are not equivalent to any Z₂Z₄-linear Hadamard code. Moreover, for each s>2, it is claimed that the new constructed nonlinear Z₂-linear Hadamard codes of length 2ᵗ are pairwise nonequivalent.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Comparing decoding methods for quaternary linear codes

  • Barrolleta, Roland David
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C. Constructions of small PD-sets for partial decoding for two families of Z₄-linear codes (Hadamard and Kerdock) are given. Moreover, different decoding methods for Z₄-linear codes are compared by showing their performance applied to these two families.
Dipòsit Digital de Documents de la UAB
Publication

Linear and cyclic codes over direct product of finite chain rings

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten-Valls, Roger|||0000-0001-5193-7491
We introduce a new type of linear and cyclic codes. These codes are defined over a direct product of two finite chain rings. The definition of these codes as certain submodules of the direct product of copies of these rings is given and the cyclic property is defined. Cyclic codes can be seen as submodules of the direct product of polynomial rings. Generator matrices for linear codes and generator polynomials for cyclic codes are determined.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

PD-sets for Z₄-linear codes, Hadamard and Kerdock codes

  • Barrolleta, Roland David
  • Villanueva, M.|||0000-0001-6179-0833
Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s+1, which enable correction up to s errors, for Z₄-linear codes is provided. Furthermore, some explicit constructions of s-PD-sets of size s+1 for important families of (nonlinear) Z₄-linear codes such as Hadamard and Kerdock codes are given.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Kernels and ranks of cyclic and negacyclic quaternary codes

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Quasi-cyclic codes as cyclic codes over a family of local rings

  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
We give an algebraic structure for a large family of binary quasi-cyclic codes. We construct a family of commutative rings and a canonical Gray map such that cyclic codes over this family of rings produce quasi-cyclic codes of arbitrary index in the Hamming space via the Gray map. We use the Gray map to produce optimal linear codes that are quasi-cyclic.
Dipòsit Digital de Documents de la UAB
Publication

Completely regular codes with different parameters and the same intersection arrays

  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a, b, we construct completely transitive codes over different fields with covering radius ρ = min{a, b} and identical intersection array, specifically, we construct one code over Fqʳ for each divisor r of a or b. As a corollary, for any prime power q, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Binary codes, binary codes databases

  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
The research group CCSG (Combinatorics, Coding and Security Group) is one of the research groups in the dEIC (Department of Information and Communications Engineering) at the UAB (Universitat Autònoma de Barcelona) in Spain. From 1987 the team CCSG has been uninterruptedly working in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Teledetection, Cryptography, Electronic Voting, e-Auctions, Mobile Agents, etc. The more important know-how of CCSG is about algorithms for forward error correction (FEC), such as Golay codes, Hamming product codes, Reed-Solomon codes, Preparata and Preparata-like codes, (extended) nonlinear 1-perfect codes, Z4-linear codes, Z2Z4-linear codes, etc.; computations of the rank and the dimension of the kernel for nonlinear codes as binary 1-perfect codes, q-ary 1-perfect codes, Preparata codes, Hadamard codes, Kerdock codes, quaternary Reed-Muller codes, etc.; the existence and structural properties for 1-perfect codes, uniformly packed codes, completely regular codes, completely transitive codes, etc...
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Q-ary codes

  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
The research group CCSG (Combinatorics, Coding and Security Group) is one of the research groups in the dEIC (Department of Information and Communications Engineering) at the UAB (Universitat Aut'onoma de Barcelona) in Spain. From 1987 the team CCSG has been uninterruptedly working in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Teledetection, Cryptography, Electronic Voting, e-Auctions, Mobile Agents, etc. The more important know-how of CCSG is about algorithms for forward error correction (FEC), such as Golay codes, Hamming product codes, Reed-Solomon codes, Preparata and Preparata-like codes, (extended) nonlinear 1-perfect codes, Z4-linear codes, Z2Z4-linear codes, etc.; computations of the rank and the dimension of the kernel for nonlinear codes as binary 1-perfect codes, q-ary 1-perfect codes, Preparata codes, Hadamard codes, Kerdock codes, quaternary Reed-Muller codes, etc.; the existence and structural properties for 1-perfect codes, uniformly packed codes, completely regular codes, completely transitive codes, etc.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Z2Z4-additive codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Gastón Brasó, Bernat
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Rifà, Josep|||0000-0001-9199-4001
  • Villanueva, M.|||0000-0001-6179-0833
The Combinatoric, Coding and Security Group (CCSG) is a research group in the Department of Information and Communications Engineering (DEIC) at the Universitat Aut'onoma de Barcelona (UAB). The research group CCSG has been uninterruptedly working since 1987 in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Cryptography, Electronic Voting, Network Coding, etc. The members of the group have been producing mainly results on optimal coding. Specifically, the research has been focused on uniformly-packed codes; perfect codes in the Hamming space; perfect codes in distance-regular graphs; the classification of optimal codes of a given length; and codes which are close to optimal codes by some properties, for example, Reed-Muller codes, Preparata codes, Kerdock codes and Hadamard codes. Part of the research developed by CCSG deals with Z2Z4-linear codes. There are no symbolic software to work with these codes, so the members of CCSG have been developing this new package that supports the basic facilities for Z2Z4-additive codes. Specifically, this Magma package generalizes most of the known functions for codes over the ring Z4, which are subgroups of Zn4, to Z2Z4-additive codes, which are subgroups of Zγ2 × Zδ4, maintaining all the functionality for codes over Z4 and adding new functions which, not only generalize the previous ones, but introduce new variants when it is needed. A beta version of this new package for Z2Z4-additive codes and this manual with the description of all functions can be downloaded from the web page http://ccsg.uab.cat. For any comment or further information about this package, you can send an e-mail to support-ccsg@deic.uab.cat. The authors would like to thank Lorena Ronquillo, Jaume Pernas, Roger Ten-Valls, and Cristina Diéguez for their contributions developing some parts of this Magma package.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

On Zpr Zps-additive cyclic codes

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

On primitive constant dimension codes and a geometrical sunflower bound

  • Barrolleta, Roland David
  • Storme, Leo
  • Suárez Canedo, E.
  • Vandendriessche, Peter
In this paper we study subspace codes with constant intersection dimension (SCIDs). We investigate the largest possible dimension spanned by such a code that can yield non-sunflower codes, and classify the examples attaining equality in that bound as one of two infinite families. We also construct a new infinite family of primitive SCIDs.