DCT

2:26-cv-00728

Malikie Innovations Ltd v. Sercomm Corp

Log In
Key Events
Complaint
complaint Intelligence

I. Executive Summary and Procedural Information

  • Case Name: Malikie Innovations Ltd. and Key Patent Innovations Ltd. v. Sercomm Corporation
  • Parties & Counsel:
  • Case Identification: 2:26-cv-00728, E.D. Tex., 08/21/2026
  • Venue Allegations: Plaintiff alleges venue is proper because Defendant is a foreign corporation not resident in the United States and may therefore be sued in any judicial district. The complaint also asserts that Defendant conducts business and commits acts of infringement in the district, including through the sale of accused products via retailers and service providers in Marshall, Texas.
  • Core Dispute: Plaintiffs, as successors-in-interest to a BlackBerry patent portfolio, allege that Defendant's Wi-Fi routers and gateways infringe four patents related to low-density parity-check (LDPC) error correction, management of multiple wireless access techniques, and automated hotspot registration.
  • Technical Context: The technologies at issue relate to fundamental aspects of wireless communication efficiency and usability, particularly within the widely adopted IEEE 802.11 (Wi-Fi) family of standards.
  • Key Procedural History: The complaint states that the asserted patents originated with BlackBerry Ltd. and that some claims are essential to the IEEE 802.11 standard. Plaintiffs allege that BlackBerry and later Malikie engaged in licensing discussions with Sercomm, including sending notice letters and claim charts beginning in October 2020, and offering to license the patents on Fair, Reasonable, and Non-Discriminatory (FRAND) terms.

Case Timeline

Date Event
2004-09-03 '856 Patent Priority Date
2004-10-12 '980 and '212 Patents Priority Date
2008-11-18 '856 Patent Issue Date
2012-03-12 '260 Patent Priority Date
2013-11-12 '980 Patent Issue Date
2018-07-24 '260 Patent Issue Date
2020-09-15 '212 Patent Issue Date
2020-10-01 BlackBerry sends notice letter to Sercomm
2023-10-04 Malikie sends notice letter to Sercomm
2023-12-01 Malikie sends exemplary claim charts to Sercomm
2024-02-11 Accused Product "g4ar" webpage available (archive.org)
2024-07-02 Malikie conducts video call with Sercomm
2025-10-22 Sercomm requests additional information from Malikie
2026-01-02 Malikie provides notice regarding '856 and '260 Patents
2026-05-24 Malikie offers specific FRAND royalty rate
2026-08-21 Complaint Filing Date

II. Technology and Patent(s)-in-Suit Analysis

U.S. Patent No. 8,583,980 - "Low-Density Parity-Check (LDPC) Code"

  • Patent Identification: U.S. Patent No. **8,583,980** ("'980 Patent"), issued November 12, 2013 Compl. ¶10

The Invention Explained

  • Problem Addressed: The patent's specification identifies issues with conventional LDPC codes where the structure of the "base parity check matrix" does not permit a "simple encoding algorithm" and where the "row weight is not uniform or not close to uniform" ('980 Patent, col. 2:11-14, as cited in Compl. ¶41).
  • The Patented Solution: The invention describes a method for constructing an LDPC code by starting with a structured base parity check matrix and then creating an "expanded parity check matrix" ('980 Patent, col. 2:22-31, as cited in Compl. ¶41). This expansion is achieved by replacing each non-zero element of the base matrix with a "shifted identity matrix" and each zero element with a "zero matrix" ('980 Patent, col. 2:27-30, as cited in Compl. ¶41). This allows for accommodating larger code rates without significant hardware redesigns ('980 Patent, col. 2:4-7, as cited in Compl. ¶42).
  • Technical Importance: This structured approach to LDPC matrix design and expansion aimed to reduce encoder and decoder complexity, enabling more efficient and flexible error correction in modern communication systems Compl. ¶42

Key Claims at a Glance

  • The complaint asserts independent claims 1 and 32 Compl. ¶44
  • The core limitations of independent claim 1 (a method claim) involve:
    • Constructing a base parity check matrix with a specific data portion (Hd) and parity portion (Hp).
    • Expanding the base parity check matrix into an expanded parity check matrix.
    • The expansion process involves replacing non-zero elements with a shifted identity matrix and zero elements with a zero matrix.
    • Applying the resulting expanded parity check matrix to decode LDPC encoded data.
  • The complaint does not explicitly reserve the right to assert other claims, though this is common practice in litigation.

U.S. Reissued Patent No. RE48,212 - "Structured low-density parity-check (LDPC) code"

  • Patent Identification: U.S. Reissued Patent No. **RE48,212** ("'212 Patent"), issued September 15, 2020 Compl. ¶11

The Invention Explained

  • Problem Addressed: The patent addresses the problem that modifying LDPC codewords for different data packet sizes, through techniques like "shortening" and "puncturing," can "severely disturb the row weight distribution of the original matrix," leading to performance degradation ('212 Patent, col. 2:53-59, as cited in Compl. ¶51). The invention also seeks to maintain high "coding gain" while managing computational complexity and power consumption ('212 Patent, col. 2:35-42, as cited in Compl. ¶52).
  • The Patented Solution: The patent discloses a method for encoding data that involves calculating and applying the appropriate amounts of shortening and puncturing to adapt a codeword for a given data packet size, while also evaluating a "performance criterion" to ensure transmission efficiency '212 Patent, claim 13 The method provides for adjusting the number of transmission symbols if the performance criterion is not met, thereby balancing coding gain and resource usage '212 Patent, claim 13 '212 Patent, col. 14:2-15
  • Technical Importance: This adaptive method for shortening and puncturing LDPC codes provides a systematic way to optimize data transmission for variable packet sizes, a critical requirement for efficient operation in complex wireless standards like IEEE 802.11 Compl. ¶51

Key Claims at a Glance

  • The complaint asserts independent claims 13 and 20 Compl. ¶54
  • The essential elements of independent claim 13 (a method claim) include:
    • Computing a number of modulated OFDM symbols for transmitting data.
    • Computing a number of shortening bits and distributing them over an LDPC codeword.
    • Computing a number of puncturing bits and distributing them over the LDPC codeword.
    • Determining if a "performance criterion" is met.
    • If the criterion is not met, increasing the number of modulated OFDM symbols and recalculating the number of puncturing bits.
    • Generating the encoded data based on the shortening and puncturing.
    • Transmitting the encoded data.
  • The complaint does not explicitly reserve the right to assert other claims.

U.S. Patent No. 7,453,856

  • Technology Synopsis: The '856 Patent addresses the difficulty of integrating different wireless "multiple access schemes" (e.g., FDMA, TDMA, CDMA) within a single system ('856 Patent, col. 1:60-2:8, as cited in Compl. ¶61). It proposes a "unified and flexible signaling method and radio interface" that can accommodate a mixture of these schemes, allowing a device to dynamically select the most suitable one based on factors like channel condition ('856 Patent, abstract; '856 Patent, col. 10:62-67, as cited in Compl. ¶¶60-61).
  • Asserted Claims: At least claims 1 and 14 Compl. ¶63
  • Accused Features: The complaint alleges that Defendant's "products implementing multiple access schemes," which are compliant with IEEE 802.11 standards, infringe the '856 Patent Compl. ¶63

U.S. Patent No. 10,034,260

  • Technology Synopsis: The '260 Patent aims to solve the "frustrating" user experience of manually registering a wireless device with a WLAN hotspot, which typically requires inputting credentials and other information ('260 Patent, col. 1:46-51; '260 Patent, col. 2:58-65, as cited in Compl. ¶¶70-71). The invention uses a "trigger message" sent via short-range wireless communication (like NFC) to "automatically initiate a registration process" with a network access point, removing the need for manual user input ('260 Patent, abstract; '260 Patent, col. 3:12-16, as cited in Compl. ¶¶70-71).
  • Asserted Claims: At least claim 12 Compl. ¶73
  • Accused Features: The complaint accuses Defendant's "products implementing registering for external networks," which are compliant with IEEE 802.11 standards Compl. ¶73

III. The Accused Instrumentality

Product Identification

The complaint identifies the "Sercomm G5SE, G4SE, and SBE1V1R" as exemplary accused products Compl. ¶44 Compl. ¶54 Compl. ¶63 Compl. ¶73 These products are described as routers and gateways Compl. ¶34

Functionality and Market Context

  • The complaint alleges these products are "devices compliant with IEEE 802.11 standards" Compl. ¶44 Their accused functionality includes implementing LDPC for error correction Compl. ¶44, utilizing multiple access schemes for wireless communication Compl. ¶63, and facilitating device registration with external networks Compl. ¶73
  • The complaint alleges these products are distributed through established channels in the U.S., including being provided by internet service providers such as Spectrum and T-Mobile to customers in the Eastern District of Texas Compl. ¶34

IV. Analysis of Infringement Allegations

The complaint references exemplary claim charts in Exhibits 5 and 6 that were not provided. Therefore, a detailed claim chart summary cannot be constructed. The narrative infringement theories are summarized below.

  • '980 Patent Infringement Allegations: The complaint alleges that the accused products, by being compliant with IEEE 802.11 standards, necessarily implement LDPC encoding and decoding Compl. ¶44 The infringement theory is that this implementation uses a structured and expanded parity check matrix that practices the methods claimed in the '980 Patent (Compl. ¶40; Compl. ¶41). The complaint states that a detailed element-by-element mapping is provided in the unattached Exhibit 5 Compl. ¶44

  • '212 Patent Infringement Allegations: The complaint alleges that the accused products, in their implementation of LDPC for 802.11 communications, infringe the '212 Patent by performing the claimed methods of adapting codewords Compl. ¶54 This allegedly includes using the patented techniques for shortening and puncturing to balance performance and efficiency when transmitting data packets of various sizes Compl. ¶51 Compl. ¶52 The complaint refers to the unattached Exhibit 6 for a detailed claim chart Compl. ¶54

  • Identified Points of Contention:

    • Scope Questions: A central question for all asserted patents is whether compliance with the IEEE 802.11 standard, as alleged for the accused products, necessarily requires practicing the specific methods and structures of the asserted claims. For the '260 Patent, a scope question may arise regarding whether the accused routers' registration process involves a "trigger message" from a "second device" as contemplated by the patent.
    • Technical Questions: For the '980 Patent, the analysis will depend on evidence demonstrating that the LDPC matrix used in the accused products has the specific structure claimed. For the '212 Patent, a key technical question is whether the accused products' firmware executes the specific multi-step algorithm for calculating and applying shortening and puncturing based on a "performance criterion," as required by claim 13.

No probative visual evidence provided in complaint.

V. Key Claim Terms for Construction

  • Term ('980 Patent): "expanded parity check matrix"

    • Context and Importance: Infringement of the '980 Patent hinges on whether the matrix used by the accused products for LDPC coding falls within the definition of the "expanded parity check matrix" recited in the claims. The construction of this term will define the structural boundaries of the invention.
    • Intrinsic Evidence for a Broader Interpretation: The patent specification describes the expansion of a base parity check matrix as "one of the common approaches" to accommodate larger code rates without redesigning hardware, which may support an interpretation that covers various methods of expansion ('980 Patent, col. 2:4-10, as cited in Compl. ¶42).
    • Intrinsic Evidence for a Narrower Interpretation: The specification also provides a specific definition, stating the matrix is expanded "by replacing each non-zero element by a shifted identity matrix; and replacing each zero element ... by a zero matrix" ('980 Patent, col. 2:27-30, as cited in Compl. ¶41). This language could support a narrower construction limited to this particular expansion technique.

  • Term ('212 Patent): "performance criterion"

    • Context and Importance: Asserted claim 13 includes a conditional step that depends on whether a "performance criterion is not met." The definition of this term is critical for determining whether this claimed step is performed by the accused products, as it governs the logic for adjusting the number of transmission symbols.
    • Intrinsic Evidence for a Broader Interpretation: The patent provides "coding gain" as an example of a performance criterion, which is a general measure of signal-to-noise efficiency '212 Patent, col. 14:2-7 This could support a broad interpretation that includes any metric used to assess transmission quality or efficiency.
    • Intrinsic Evidence for a Narrower Interpretation: The patent also describes maintaining performance as a multi-faceted balancing act, involving selecting codeword size, minimizing modulated symbols, and keeping complexity "at a reasonable level" ('212 Patent, col. 2:35-42, as cited in Compl. ¶52). This may support an argument that the "performance criterion" must be a composite measure that considers this balance, rather than any single, simple metric.

VI. Other Allegations

  • Indirect Infringement: For all four asserted patents, the complaint alleges induced infringement, stating that Defendant provided instructions (e.g., user manuals) that encourage customers to use the infringing Wi-Fi features of the accused products Compl. ¶46 Compl. ¶56 Compl. ¶65 Compl. ¶75 The complaint also alleges contributory infringement, asserting that Defendant supplied devices that constitute a material part of the claimed inventions, are not staple articles of commerce, and are known to be especially made for use in an infringing manner Compl. ¶47 Compl. ¶57 Compl. ¶66 Compl. ¶76
  • Willful Infringement: The complaint alleges that Defendant had pre-suit knowledge of the '980 and '212 patents since at least October 1, 2020, and of the '856 and '260 patents since at least January 2, 2026, based on notice letters sent by BlackBerry and Malikie Compl. ¶43 Compl. ¶53 Compl. ¶62 Compl. ¶72 The complaint asserts that Defendant's continued infringement despite this notice is willful Compl. ¶48 Compl. ¶58 Compl. ¶67 Compl. ¶77

VII. Analyst's Conclusion: Key Questions for the Case

  1. A central issue will be one of standard essentiality and conduct: To what extent are the asserted claims essential to the IEEE 802.11 standard, as Plaintiffs allege, and did the parties fulfill their reciprocal duties to negotiate a license in good faith on FRAND terms, as required by the standard's patent policy?
  2. A key evidentiary question will be one of technical implementation: Does the evidence, presumably derived from reverse engineering of the accused products or from the 802.11 standard's specifications, demonstrate that the products practice the specific matrix construction of the '980 patent and the precise, multi-step shortening/puncturing algorithm of the '212 patent, or is there a functional but technically distinct implementation?
  3. A core question for the '260 patent will be one of architectural scope: Can the patent's claim of a registration process initiated by a "trigger message" from a "second device" using short-range communication be construed to read on the network registration architecture used by Defendant's routers and gateways, or is there a fundamental mismatch between the claimed system and the accused system?