More precisely, for a suitable choice of derivatives of h(x, y) = f (x) + g(y), where g is a bent function and f satisfies certain minimality requirements, for any fixed f, one can derive a huge class of non-eq
obtained a necessary and sufficient condition for a binary linear code to be minimal and constructed three infinite families of minimal binary linear codes with wminwmax≤12 [12]. After that, Ding et al. derived a sufficient and necessary condition for linear codes over arbitrary finite fields ...
provided families of minimal codes violating Ashikhmin–Barg’s condition by generalizing the constructions in [9], [10] to the finite field of odd characteristic. Zhang et al. [15] obtained four families of minimal binary linear codes with wmin∕wmax≤1∕2 from the linear codes proposed by...
In this paper, we consider minimal linear codes by a general construction of linear codes fromq-ary functions. First, we give necessary and sufficient conditions for codewords which are constructed by functions to be minimal. Second, as applications, we present three constructions of minimal linear...
LaunchInstrumentationTargetBinary LaunchSamplingTarget Layer LayerDiagram LayerFillSlider LayoutEditorPart LayoutPanel LayoutPoints LayoutTransform LeftArrowAsterisk LeftBorder LeftCarriageReturn LeftColumnOfTwoColumnsRightSplit LeftSideOnly LegacyPackage Legend LESSStyleSheet LevelAll LevelEight ...
b threshold binary group testing: ?. SPECIFIC (inefficient implementation) l linear: ?. ANY (inneficient implementation due to larger number of time measurements) -e: eviction strategy 0 optimal for Haswell 1 optimal for Skylake 2 simple traversing element by element (default) 3 optimal for Skyl...
Binary separation of viable from non-viable DPSCs can be achieved at 10 MHz operating frequency by reducing the medium conductivity to 0.05 S/m (Supplementary Fig. S7), indicating that a lower operating fre- quency is required for optimum separation in high conductivity medium for ...
cells must be round; cells must not have apparent holes or punctures; cells must be completely within the field of view; cells must have an unambiguous perimeter; there must be no suggestion that a cell is currently or has recently undergone binary fission; cells must be ≥0.1 μm acro...
First of all we observe that: Since Φ is a linear map and CL, CL1 are linear codes over Z2[u], Φ(CL) and Φ(CL1) are linear over Z2. Next we will use some characterizations of binary linear codes. Proposition 4.1 Let CL be the linear code over Z2[u] as in Theorem 3.2. ...
23 Binary Merge will minimally take two lexical items (LIs) α and β in order to put them into a (crucially unordered) set: (26) Merge (α, β) = {α, β} If α is a verb and β is a noun, for example, then, by Minimalist logic, this minimal set should be all there is ...